Recognised as Number
7,970,033
- Positive
- Odd
- Prime
- 7 digits
7,970,033 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,970,033
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,970,033
Distinct prime factors17,970,033
Number of divisors2
Sum of divisors σ(n)7,970,034
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,970,032integers below n that share no factor with it
Carmichael function λ(n)7,970,032the 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,970,0332 in total
Arithmetic
Previous number7,970,032
Next number7,970,034
Double15,940,066
Half3,985,016.5
Square63,521,426,021,089
Cube506,267,861,595,138,025,937
Square root2,823.124687292≈irrational, shown to 9 decimal places
Cube root199.749962537≈
Negation-7,970,033
Reciprocal1.25469995 × 10^-7≈
Representations
Decimal7,970,033
Binary1111001100111001111000123 bits
Octal36316361
Hexadecimal799CF1
Base 364QTPT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, nine hundred and seventy thousand and thirty-three
Ordinalseven million, nine hundred and seventy thousand and thirty-third
Scientific notation7.970033 × 10^6
Engineering notation7.970033 × 10^6
In other bases
Ternary112222220211102base 3; the most digit-efficient integer base after e: 15 digits
Quinary4020020113base 5; one hand: 10 digits
Septenary124513151base 7: 9 digits
Nonary15886742base 9; each digit is two ternary digits: 8 digits
Duodecimal2804355base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal29g51dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal36:53:53:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT00000T1T1111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100011101110110100110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011110011001110011110001
Bit length23 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits9within that length
Bit parityeven14 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
Bytes379 9c f1
Gray code10001010101001010001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011110011001110011110001
64-bit0000000000000000000000000000000000000000011110011001110011110001
One's complement11111111100001100110001100001110at 32 bits, every bit flipped
Bits reversed10001111001110011001111000000000at 32 bits
Rotated left by 100000000111100110011100111100010at 32 bits, wrapping
Shifted left by 1111100110011100111100010= 15,940,066, no wrap
Shifted right by 11111001100111001111000= 3,985,016, discarding the low bit
These bits as a double3.9377195 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,970,033 to the power 263,521,426,021,089
7,970,033 to the power 3506,267,861,595,138,025,937
7,970,033 to the power 44,034,971,563,752,682,706,272,745,921
7,970,033 to the power 532,158,856,517,170,485,007,523,091,990,985,393
First ten multiples7,970,033, 15,940,066, 23,910,099, 31,880,132, 39,850,165, 47,820,198, 55,790,231, 63,760,264, 71,730,297, 79,700,330
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 33
Collatz (3n + 1) trajectory
Steps to reach 1292the total stopping time
Highest value reached23,910,1003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,970,033 → 23,910,100 → 11,955,050 → 5,977,525 → 17,932,576 → 8,966,288 → 4,483,144 → 2,241,572 → 1,120,786 → 560,393 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage797,003,300%
7,970,033% as a decimal79,700.33
7,970,033% of 1007,970,033
7,970,033% of 1,00079,700,330
As a fraction of 1007,970,033/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,970,033
Nerdulate something else
Nothing in mind? Surprise me · today’s page