Recognised as Number
7,213,337
- Positive
- Odd
- Prime
- 7 digits
7,213,337 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,213,337
Digit count7
Digit sum26
Digit product2,646
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,213,337
Distinct prime factors17,213,337
Number of divisors2
Sum of divisors σ(n)7,213,338
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,213,336integers below n that share no factor with it
Carmichael function λ(n)7,213,336the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7,213,3372 in total
Arithmetic
Previous number7,213,336
Next number7,213,338
Double14,426,674
Half3,606,668.5
Square52,032,230,675,569
Cube375,326,014,724,616,863,753
Square root2,685.765626409≈irrational, shown to 9 decimal places
Cube root193.217032378≈
Negation-7,213,337
Reciprocal1.38632092 × 10^-7≈
Representations
Decimal7,213,337
Binary1101110000100010001100123 bits
Octal33410431
Hexadecimal6E1119
Base 364ALUH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, two hundred and thirteen thousand, three hundred and thirty-seven
Ordinalseven million, two hundred and thirteen thousand, three hundred and thirty-seventh
Scientific notation7.213337 × 10^6
Engineering notation7.213337 × 10^6
In other bases
Ternary111120110211122base 3; the most digit-efficient integer base after e: 15 digits
Quinary3321311322base 5; one hand: 10 digits
Septenary115212065base 7: 9 digits
Nonary14513748base 9; each digit is two ternary digits: 8 digits
Duodecimal24ba475base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal251d6hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal33:23:42:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTTT01110TTT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100100001000101101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011011100001000100011001
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes36e 11 19
Gray code10110010001100110010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011011100001000100011001
64-bit0000000000000000000000000000000000000000011011100001000100011001
One's complement11111111100100011110111011100110at 32 bits, every bit flipped
Bits reversed10011000100010000111011000000000at 32 bits
Rotated left by 100000000110111000010001000110010at 32 bits, wrapping
Shifted left by 1110111000010001000110010= 14,426,674, no wrap
Shifted right by 11101110000100010001100= 3,606,668, discarding the low bit
These bits as a double3.563862 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,213,337 to the power 252,032,230,675,569
7,213,337 to the power 3375,326,014,724,616,863,753
7,213,337 to the power 42,707,353,029,075,623,634,133,473,761
7,213,337 to the power 519,529,049,776,693,271,758,169,449,218,750,457
First ten multiples7,213,337, 14,426,674, 21,640,011, 28,853,348, 36,066,685, 43,280,022, 50,493,359, 57,706,696, 64,920,033, 72,133,370
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 1235the total stopping time
Highest value reached24,345,0163× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,213,337 → 21,640,012 → 10,820,006 → 5,410,003 → 16,230,010 → 8,115,005 → 24,345,016 → 12,172,508 → 6,086,254 → 3,043,127 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage721,333,700%
7,213,337% as a decimal72,133.37
7,213,337% of 1007,213,337
7,213,337% of 1,00072,133,370
As a fraction of 1007,213,337/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 7,213,337
Nerdulate something else
Nothing in mind? Surprise me · today’s page