Recognised as Number
1,476,109
- Positive
- Odd
- Prime
- 7 digits
1,476,109 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,476,109
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 factorisation1,476,109
Distinct prime factors11,476,109
Number of divisors2
Sum of divisors σ(n)1,476,110
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,476,108integers below n that share no factor with it
Carmichael function λ(n)1,476,108the 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,1092 in total
Arithmetic
Previous number1,476,108
Next number1,476,110
Double2,952,218
Half738,054.5
Square2,178,897,779,881
Cube3,216,290,622,962,363,029
Square root1,214.952262437≈irrational, shown to 9 decimal places
Cube root113.860427321≈
Negation-1,476,109
Reciprocal6.77456746 × 10^-7≈
Representations
Decimal1,476,109
Binary10110100001100000110121 bits
Octal5503015
Hexadecimal16860D
Base 36VMZ1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and seventy-six thousand, one hundred and nine
Ordinalone million, four hundred and seventy-six thousand, one hundred and ninth
Scientific notation1.476109 × 10^6
Engineering notation1.476109 × 10^6
In other bases
Ternary2202222211201base 3; the most digit-efficient integer base after e: 13 digits
Quinary334213414base 5; one hand: 9 digits
Septenary15355345base 7: 8 digits
Nonary2688751base 9; each digit is two ternary digits: 7 digits
Duodecimal5b2291base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal94a59base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:50:1:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T100000TTT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010111001101000011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101101000011000001101
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 86 0d
Gray code111011100010100001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101101000011000001101
64-bit0000000000000000000000000000000000000000000101101000011000001101
One's complement11111111111010010111100111110010at 32 bits, every bit flipped
Bits reversed10110000011000010110100000000000at 32 bits
Rotated left by 100000000001011010000110000011010at 32 bits, wrapping
Shifted left by 11011010000110000011010= 2,952,218, no wrap
Shifted right by 110110100001100000110= 738,054, discarding the low bit
These bits as a double7.29294746 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,476,109 to the power 22,178,897,779,881
1,476,109 to the power 33,216,290,622,962,363,029
1,476,109 to the power 44,747,595,535,170,350,728,374,161
1,476,109 to the power 57,007,968,497,824,771,243,309,654,419,549
First ten multiples1,476,109, 2,952,218, 4,428,327, 5,904,436, 7,380,545, 8,856,654, 10,332,763, 11,808,872, 13,284,981, 14,761,090
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1119the total stopping time
Highest value reached4,428,3283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,476,109 → 4,428,328 → 2,214,164 → 1,107,082 → 553,541 → 1,660,624 → 830,312 → 415,156 → 207,578 → 103,789 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage147,610,900%
1,476,109% as a decimal14,761.09
1,476,109% of 1001,476,109
1,476,109% of 1,00014,761,090
As a fraction of 1001,476,109/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,109
Nerdulate something else
Nothing in mind? Surprise me · today’s page