Recognised as Number
1,508,146
- Positive
- Even
- Composite
- 7 digits
1,508,146 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,508,146
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2 × 754,073
Distinct prime factors22, 754,073
Number of divisors4
Sum of divisors σ(n)2,262,222
Aliquot sum754,076sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)754,072integers below n that share no factor with it
Carmichael function λ(n)754,072the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 754,073, 1,508,1464 in total
Arithmetic
Previous number1,508,145
Next number1,508,147
Double3,016,292
Half754,073
Square2,274,504,357,316
Cube3,430,284,648,468,696,136
Square root1,228.065959141≈irrational, shown to 9 decimal places
Cube root114.678268987≈
Negation-1,508,146
Reciprocal6.63065777 × 10^-7≈
Representations
Decimal1,508,146
Binary10111000000110011001021 bits
Octal5601462
Hexadecimal170332
Base 36WBOY
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and eight thousand, one hundred and forty-six
Ordinalone million, five hundred and eight thousand, one hundred and forty-sixth
Scientific notation1.508146 × 10^6
Engineering notation1.508146 × 10^6
In other bases
Ternary2211121210021base 3; the most digit-efficient integer base after e: 13 digits
Quinary341230041base 5; one hand: 9 digits
Septenary15550633base 7: 8 digits
Nonary2747707base 9; each digit is two ternary digits: 7 digits
Duodecimal60892abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal98a76base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:58:55:46base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100TTT0TT101T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010110000011101110110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101110000001100110010
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes317 03 32
Gray code111001000001010101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101110000001100110010
64-bit0000000000000000000000000000000000000000000101110000001100110010
One's complement11111111111010001111110011001101at 32 bits, every bit flipped
Bits reversed01001100110000001110100000000000at 32 bits
Rotated left by 100000000001011100000011001100100at 32 bits, wrapping
Shifted left by 11011100000011001100100= 3,016,292, no wrap
Shifted right by 110111000000110011001= 754,073, discarding the low bit
These bits as a double7.45123128 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,508,146 to the power 22,274,504,357,316
1,508,146 to the power 33,430,284,648,468,696,136
1,508,146 to the power 45,173,370,071,449,470,202,723,856
1,508,146 to the power 57,802,197,379,776,232,688,357,172,530,976
First ten multiples1,508,146, 3,016,292, 4,524,438, 6,032,584, 7,540,730, 9,048,876, 10,557,022, 12,065,168, 13,573,314, 15,081,460
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 7
Divisible by 10No, remainder 6
Divisible by 11No, remainder 2
Divisible by 12No, remainder 10
Divisible by 100No, remainder 46
Collatz (3n + 1) trajectory
Steps to reach 162the total stopping time
Highest value reached2,545,0001× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,508,146 → 754,073 → 2,262,220 → 1,131,110 → 565,555 → 1,696,666 → 848,333 → 2,545,000 → 1,272,500 → 636,250 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage150,814,600%
1,508,146% as a decimal15,081.46
1,508,146% of 1001,508,146
1,508,146% of 1,00015,081,460
As a fraction of 1001,508,146/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,508,146
Nerdulate something else
Nothing in mind? Surprise me · today’s page