Recognised as Number

1,460,125

Positive
Odd
Composite
7 digits

1,460,125 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,460,125

Digit count7

Digit sum19

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 factorisation5^3 × 11,681

Distinct prime factors25, 11,681

Number of divisors8

Sum of divisors σ(n)1,822,392

Aliquot sum362,267sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,168,000integers below n that share no factor with it

Carmichael function λ(n)58,400the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,168,000

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 5, 25, 125, 11,681, 58,405, 292,025, 1,460,1258 in total

Arithmetic

Previous number1,460,124

Next number1,460,126

Double2,920,250

Half730,062.5

Square2,131,965,015,625

Cube3,112,935,418,439,453,125

Square root1,208.35632162≈irrational, shown to 9 decimal places

Cube root113.447956889≈

Negation-1,460,125

Reciprocal6.8487287 × 10^-7≈

Representations

Decimal1,460,125

Binary10110010001111001110121 bits

Octal5443635

Hexadecimal16479D

Base 36VAN1

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, four hundred and sixty thousand, one hundred and twenty-five

Ordinalone million, four hundred and sixty thousand, one hundred and twenty-fifth

Scientific notation1.460125 × 10^6

Engineering notation1.460125 × 10^6

In other bases

Ternary2202011220201base 3; the most digit-efficient integer base after e: 13 digits

Quinary333211000base 5; one hand: 9 digits

Septenary15260632base 7: 8 digits

Nonary2664821base 9; each digit is two ternary digits: 7 digits

Duodecimal5a4b91base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal92a65base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal6:45:35:25base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary10T1T1TT0T1T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11010100101100011101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101100100011110011101

Bit length21 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits9within that length

Bit parityeven12 set bits, so even; 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 47 9d

Gray code111010110010001010011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101100100011110011101

64-bit0000000000000000000000000000000000000000000101100100011110011101

One's complement11111111111010011011100001100010at 32 bits, every bit flipped

Bits reversed10111001111000100110100000000000at 32 bits

Rotated left by 100000000001011001000111100111010at 32 bits, wrapping

Shifted left by 11011001000111100111010= 2,920,250, no wrap

Shifted right by 110110010001111001110= 730,062, discarding the low bit

These bits as a double7.21397601 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,460,143+18

Previous prime1,460,117−8

Distance to nearest prime8

Nearest square below1,459,264

Nearest square above1,461,681

Powers & multiples

1,460,125 to the power 22,131,965,015,625

1,460,125 to the power 33,112,935,418,439,453,125

1,460,125 to the power 44,545,274,827,848,906,494,140,625

1,460,125 to the power 56,636,669,408,012,884,594,757,080,078,125

First ten multiples1,460,125, 2,920,250, 4,380,375, 5,840,500, 7,300,625, 8,760,750, 10,220,875, 11,681,000, 13,141,125, 14,601,250

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 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 5

Divisible by 11No, remainder 7

Divisible by 12No, remainder 1

Divisible by 100No, remainder 25

Collatz (3n + 1) trajectory

Steps to reach 1181the total stopping time

Highest value reached11,840,4168× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,460,125 → 4,380,376 → 2,190,188 → 1,095,094 → 547,547 → 1,642,642 → 821,321 → 2,463,964 → 1,231,982 → 615,991 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage146,012,500%

1,460,125% as a decimal14,601.25

1,460,125% of 1001,460,125

1,460,125% of 1,00014,601,250

As a fraction of 1001,460,125/100

Read another way

As seconds16 days, 21 hours and 35 minutes

As bytes1.392 MiB

As a 24-bit colour#16479D

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.