Recognised as Number
7,219,997
- Positive
- Odd
- Prime
- 7 digits
7,219,997 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,219,997
Digit count7
Digit sum44
Digit product71,442
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,219,997
Distinct prime factors17,219,997
Number of divisors2
Sum of divisors σ(n)7,219,998
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,219,996integers below n that share no factor with it
Carmichael function λ(n)7,219,996the 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,219,9972 in total
Arithmetic
Previous number7,219,996
Next number7,219,998
Double14,439,994
Half3,609,998.5
Square52,128,356,680,009
Cube376,366,578,844,594,939,973
Square root2,687.005210267≈irrational, shown to 9 decimal places
Cube root193.276479187≈
Negation-7,219,997
Reciprocal1.38504213 × 10^-7≈
Representations
Decimal7,219,997
Binary1101110001010110001110123 bits
Octal33425435
Hexadecimal6E2B1D
Base 364AQZH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, two hundred and nineteen thousand, nine hundred and ninety-seven
Ordinalseven million, two hundred and nineteen thousand, nine hundred and ninety-seventh
Scientific notation7.219997 × 10^6
Engineering notation7.219997 × 10^6
In other bases
Ternary111120210222022base 3; the most digit-efficient integer base after e: 15 digits
Quinary3322014442base 5; one hand: 10 digits
Septenary115240361base 7: 9 digits
Nonary14523868base 9; each digit is two ternary digits: 8 digits
Duodecimal25022a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2529jhbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal33:25:33:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTTT1T1100T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100100111111101101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011011100010101100011101
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 set bits, so odd; 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 2b 1d
Gray code10110010011111010010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011011100010101100011101
64-bit0000000000000000000000000000000000000000011011100010101100011101
One's complement11111111100100011101010011100010at 32 bits, every bit flipped
Bits reversed10111000110101000111011000000000at 32 bits
Rotated left by 100000000110111000101011000111010at 32 bits, wrapping
Shifted left by 1110111000101011000111010= 14,439,994, no wrap
Shifted right by 11101110001010110001110= 3,609,998, discarding the low bit
These bits as a double3.56715248 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,219,997 to the power 252,128,356,680,009
7,219,997 to the power 3376,366,578,844,594,939,973
7,219,997 to the power 42,717,365,570,158,238,932,820,240,081
7,219,997 to the power 519,619,371,264,445,774,620,245,334,924,099,757
First ten multiples7,219,997, 14,439,994, 21,659,991, 28,879,988, 36,099,985, 43,319,982, 50,539,979, 57,759,976, 64,979,973, 72,199,970
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 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 97
Collatz (3n + 1) trajectory
Steps to reach 1142the total stopping time
Highest value reached21,659,9923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,219,997 → 21,659,992 → 10,829,996 → 5,414,998 → 2,707,499 → 8,122,498 → 4,061,249 → 12,183,748 → 6,091,874 → 3,045,937 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage721,999,700%
7,219,997% as a decimal72,199.97
7,219,997% of 1007,219,997
7,219,997% of 1,00072,199,970
As a fraction of 1007,219,997/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,219,997
Nerdulate something else
Nothing in mind? Surprise me · today’s page