Recognised as Number
1,476,091
- Positive
- Odd
- Composite
- 7 digits
1,476,091 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,476,091
Digit count7
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation19 × 77,689
Distinct prime factors219, 77,689
Number of divisors4
Sum of divisors σ(n)1,553,800
Aliquot sum77,709sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,398,384integers below n that share no factor with it
Carmichael function λ(n)77,688the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,398,384
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 19, 77,689, 1,476,0914 in total
Arithmetic
Previous number1,476,090
Next number1,476,092
Double2,952,182
Half738,045.5
Square2,178,844,640,281
Cube3,216,172,963,917,021,571
Square root1,214.944854716≈irrational, shown to 9 decimal places
Cube root113.859964506≈
Negation-1,476,091
Reciprocal6.77465007 × 10^-7≈
Representations
Decimal1,476,091
Binary10110100001011111101121 bits
Octal5502773
Hexadecimal1685FB
Base 36VMYJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and seventy-six thousand and ninety-one
Ordinalone million, four hundred and seventy-six thousand and ninety-first
Scientific notation1.476091 × 10^6
Engineering notation1.476091 × 10^6
In other bases
Ternary2202222211001base 3; the most digit-efficient integer base after e: 13 digits
Quinary334213331base 5; one hand: 9 digits
Septenary15355321base 7: 8 digits
Nonary2688731base 9; each digit is two ternary digits: 7 digits
Duodecimal5b2277base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal94a4bbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:50:1:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T10000T11001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010111001101000001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101101000010111111011
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 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 85 fb
Gray code111011100011100000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101101000010111111011
64-bit0000000000000000000000000000000000000000000101101000010111111011
One's complement11111111111010010111101000000100at 32 bits, every bit flipped
Bits reversed11011111101000010110100000000000at 32 bits
Rotated left by 100000000001011010000101111110110at 32 bits, wrapping
Shifted left by 11011010000101111110110= 2,952,182, no wrap
Shifted right by 110110100001011111101= 738,045, discarding the low bit
These bits as a double7.29285853 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,476,091 to the power 22,178,844,640,281
1,476,091 to the power 33,216,172,963,917,021,571
1,476,091 to the power 44,747,363,966,481,240,287,758,961
1,476,091 to the power 57,007,541,224,647,260,457,598,412,501,451
First ten multiples1,476,091, 2,952,182, 4,428,273, 5,904,364, 7,380,455, 8,856,546, 10,332,637, 11,808,728, 13,284,819, 14,760,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 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 162the total stopping time
Highest value reached8,406,8085× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,476,091 → 4,428,274 → 2,214,137 → 6,642,412 → 3,321,206 → 1,660,603 → 4,981,810 → 2,490,905 → 7,472,716 → 3,736,358 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage147,609,100%
1,476,091% as a decimal14,760.91
1,476,091% of 1001,476,091
1,476,091% of 1,00014,760,910
As a fraction of 1001,476,091/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,091
Nerdulate something else
Nothing in mind? Surprise me · today’s page