Recognised as Number
7,913,981
- Positive
- Odd
- Prime
- 7 digits
7,913,981 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,913,981
Digit count7
Digit sum38
Digit product13,608
Multiplicative persistence2times 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,913,981
Distinct prime factors17,913,981
Number of divisors2
Sum of divisors σ(n)7,913,982
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,913,980integers below n that share no factor with it
Carmichael function λ(n)7,913,980the 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,913,9812 in total
Arithmetic
Previous number7,913,980
Next number7,913,982
Double15,827,962
Half3,956,990.5
Square62,631,095,268,361
Cube495,661,297,962,998,855,141
Square root2,813.179873382≈irrational, shown to 9 decimal places
Cube root199.280590352≈
Negation-7,913,981
Reciprocal1.26358656 × 10^-7≈
Representations
Decimal7,913,981
Binary1111000110000011111110123 bits
Octal36140775
Hexadecimal78C1FD
Base 364PMGT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, nine hundred and thirteen thousand, nine hundred and eighty-one
Ordinalseven million, nine hundred and thirteen thousand, nine hundred and eighty-first
Scientific notation7.913981 × 10^6
Engineering notation7.913981 × 10^6
In other bases
Ternary112220001221102base 3; the most digit-efficient integer base after e: 15 digits
Quinary4011221411base 5; one hand: 10 digits
Septenary124160555base 7: 9 digits
Nonary15801842base 9; each digit is two ternary digits: 8 digits
Duodecimal2797a25base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2994j1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal36:38:19:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT00T001T0T111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100010011100011000001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011110001100000111111101
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
Bytes378 c1 fd
Gray code10001001010000100000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011110001100000111111101
64-bit0000000000000000000000000000000000000000011110001100000111111101
One's complement11111111100001110011111000000010at 32 bits, every bit flipped
Bits reversed10111111100000110001111000000000at 32 bits
Rotated left by 100000000111100011000001111111010at 32 bits, wrapping
Shifted left by 1111100011000001111111010= 15,827,962, no wrap
Shifted right by 11111000110000011111110= 3,956,990, discarding the low bit
These bits as a double3.91002613 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,913,981 to the power 262,631,095,268,361
7,913,981 to the power 3495,661,297,962,998,855,141
7,913,981 to the power 43,922,654,094,514,511,642,607,626,321
7,913,981 to the power 531,043,809,973,560,049,363,875,545,159,493,901
First ten multiples7,913,981, 15,827,962, 23,741,943, 31,655,924, 39,569,905, 47,483,886, 55,397,867, 63,311,848, 71,225,829, 79,139,810
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 81
Collatz (3n + 1) trajectory
Steps to reach 193the total stopping time
Highest value reached67,608,9168× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,913,981 → 23,741,944 → 11,870,972 → 5,935,486 → 2,967,743 → 8,903,230 → 4,451,615 → 13,354,846 → 6,677,423 → 20,032,270 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage791,398,100%
7,913,981% as a decimal79,139.81
7,913,981% of 1007,913,981
7,913,981% of 1,00079,139,810
As a fraction of 1007,913,981/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,913,981
Nerdulate something else
Nothing in mind? Surprise me · today’s page