Recognised as Number
1,476,691
- Positive
- Odd
- Prime
- 7 digits
1,476,691 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,476,691
Digit count7
Digit sum34
Digit product9,072
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,476,691
Distinct prime factors11,476,691
Number of divisors2
Sum of divisors σ(n)1,476,692
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,476,690integers below n that share no factor with it
Carmichael function λ(n)1,476,690the 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, 1,476,6912 in total
Arithmetic
Previous number1,476,690
Next number1,476,692
Double2,953,382
Half738,345.5
Square2,180,616,309,481
Cube3,220,096,478,663,807,371
Square root1,215.191754416≈irrational, shown to 9 decimal places
Cube root113.875389644≈
Negation-1,476,691
Reciprocal6.77189744 × 10^-7≈
Representations
Decimal1,476,691
Binary10110100010000101001121 bits
Octal5504123
Hexadecimal168853
Base 36VNF7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and seventy-six thousand, six hundred and ninety-one
Ordinalone million, four hundred and seventy-six thousand, six hundred and ninety-first
Scientific notation1.476691 × 10^6
Engineering notation1.476691 × 10^6
In other bases
Ternary2210000122021base 3; the most digit-efficient integer base after e: 13 digits
Quinary334223231base 5; one hand: 9 digits
Septenary15360136base 7: 8 digits
Nonary2700567base 9; each digit is two ternary digits: 7 digits
Duodecimal5b2697base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal94bebbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:50:11:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T10001T0T1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010111001100001010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101101000100001010011
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes316 88 53
Gray code111011100110001111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101101000100001010011
64-bit0000000000000000000000000000000000000000000101101000100001010011
One's complement11111111111010010111011110101100at 32 bits, every bit flipped
Bits reversed11001010000100010110100000000000at 32 bits
Rotated left by 100000000001011010001000010100110at 32 bits, wrapping
Shifted left by 11011010001000010100110= 2,953,382, no wrap
Shifted right by 110110100010000101001= 738,345, discarding the low bit
These bits as a double7.29582293 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,476,691 to the power 22,180,616,309,481
1,476,691 to the power 33,220,096,478,663,807,371
1,476,691 to the power 44,755,087,489,174,536,370,489,361
1,476,691 to the power 57,021,794,899,476,635,287,474,304,984,451
First ten multiples1,476,691, 2,953,382, 4,430,073, 5,906,764, 7,383,455, 8,860,146, 10,336,837, 11,813,528, 13,290,219, 14,766,910
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1150the total stopping time
Highest value reached8,410,2285× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,476,691 → 4,430,074 → 2,215,037 → 6,645,112 → 3,322,556 → 1,661,278 → 830,639 → 2,491,918 → 1,245,959 → 3,737,878 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage147,669,100%
1,476,691% as a decimal14,766.91
1,476,691% of 1001,476,691
1,476,691% of 1,00014,766,910
As a fraction of 1001,476,691/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 1,476,691
Nerdulate something else
Nothing in mind? Surprise me · today’s page