Recognised as Number

1,460,127

Positive
Odd
Composite
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,460,127

Digit count7

Digit sum21

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 181 × 2,689

Distinct prime factors33, 181, 2,689

Number of divisors8

Sum of divisors σ(n)1,958,320

Aliquot sum498,193sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)967,680integers below n that share no factor with it

Carmichael function λ(n)40,320the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 967,680

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 181, 543, 2,689, 8,067, 486,709, 1,460,1278 in total

Arithmetic

Previous number1,460,126

Next number1,460,128

Double2,920,254

Half730,063.5

Square2,131,970,856,129

Cube3,112,948,210,247,068,383

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

Cube root113.448008687≈

Negation-1,460,127

Reciprocal6.84871932 × 10^-7≈

Representations

Decimal1,460,127

Binary10110010001111001111121 bits

Octal5443637

Hexadecimal16479F

Base 36VAN3

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

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

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

Scientific notation1.460127 × 10^6

Engineering notation1.460127 × 10^6

In other bases

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

Quinary333211002base 5; one hand: 9 digits

Septenary15260634base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101100100011110011111

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 47 9f

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

At each machine width

32-bit00000000000101100100011110011111

64-bit0000000000000000000000000000000000000000000101100100011110011111

One's complement11111111111010011011100001100000at 32 bits, every bit flipped

Bits reversed11111001111000100110100000000000at 32 bits

Rotated left by 100000000001011001000111100111110at 32 bits, wrapping

Shifted left by 11011001000111100111110= 2,920,254, no wrap

Shifted right by 110110010001111001111= 730,063, discarding the low bit

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

Nearest landmarks

Next prime1,460,143+16

Previous prime1,460,117−10

Distance to nearest prime10

Nearest square below1,459,264

Nearest square above1,461,681

Powers & multiples

1,460,127 to the power 22,131,970,856,129

1,460,127 to the power 33,112,948,210,247,068,383

1,460,127 to the power 44,545,299,731,383,421,216,864,641

1,460,127 to the power 56,636,714,860,885,680,671,116,917,669,407

First ten multiples1,460,127, 2,920,254, 4,380,381, 5,840,508, 7,300,635, 8,760,762, 10,220,889, 11,681,016, 13,141,143, 14,601,270

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 3

Divisible by 10No, remainder 7

Divisible by 11No, remainder 9

Divisible by 12No, remainder 3

Divisible by 100No, remainder 27

Collatz (3n + 1) trajectory

Steps to reach 1199the total stopping time

Highest value reached39,961,34827× the starting value

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

First steps1,460,127 → 4,380,382 → 2,190,191 → 6,570,574 → 3,285,287 → 9,855,862 → 4,927,931 → 14,783,794 → 7,391,897 → 22,175,692 → …

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

As a percentage & fraction

As a percentage146,012,700%

1,460,127% as a decimal14,601.27

1,460,127% of 1001,460,127

1,460,127% of 1,00014,601,270

As a fraction of 1001,460,127/100

Read another way

As seconds16 days, 21 hours and 35 minutes

As bytes1.392 MiB

As a 24-bit colour#16479F

Keep nerding

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