Recognised as Number

1,201,729

Positive
Odd
Prime
7 digits

1,201,729 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,201,729

Digit count7

Digit sum22

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,201,729

Distinct prime factors11,201,729

Number of divisors2

Sum of divisors σ(n)1,201,730

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,201,728the 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,201,7292 in total

Arithmetic

Previous number1,201,728

Next number1,201,730

Double2,403,458

Half600,864.5

Square1,444,152,589,441

Cube1,735,480,047,156,343,489

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

Cube root106.316869555≈

Negation-1,201,729

Reciprocal8.32134366 × 10^-7≈

Representations

Decimal1,201,729

Binary10010010101100100000121 bits

Octal4453101

Hexadecimal125641

Base 36PR9D

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

In wordsone million, two hundred and one thousand, seven hundred and twenty-nine

Ordinalone million, two hundred and one thousand, seven hundred and twenty-ninth

Scientific notation1.201729 × 10^6

Engineering notation1.201729 × 10^6

In other bases

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

Quinary301423404base 5; one hand: 9 digits

Septenary13133404base 7: 8 digits

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

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

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

Sexagesimal5:33:48:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100100101011001000001

Bit length21 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits13within that length

Bit parityeven8 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

Bytes312 56 41

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

At each machine width

32-bit00000000000100100101011001000001

64-bit0000000000000000000000000000000000000000000100100101011001000001

One's complement11111111111011011010100110111110at 32 bits, every bit flipped

Bits reversed10000010011010100100100000000000at 32 bits

Rotated left by 100000000001001001010110010000010at 32 bits, wrapping

Shifted left by 11001001010110010000010= 2,403,458, no wrap

Shifted right by 110010010101100100000= 600,864, discarding the low bit

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

Nearest landmarks

Next prime1,201,787+58

Previous prime1,201,709−20

Distance to nearest prime0, it is prime

Nearest square below1,201,216

Nearest square above1,203,409

Powers & multiples

1,201,729 to the power 21,444,152,589,441

1,201,729 to the power 31,735,480,047,156,343,489

1,201,729 to the power 42,085,576,701,589,145,504,692,481

1,201,729 to the power 52,506,298,004,024,022,238,208,590,499,649

First ten multiples1,201,729, 2,403,458, 3,605,187, 4,806,916, 6,008,645, 7,210,374, 8,412,103, 9,613,832, 10,815,561, 12,017,290

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 4

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 9

Divisible by 11No, remainder 1

Divisible by 12No, remainder 1

Divisible by 100No, remainder 29

Collatz (3n + 1) trajectory

Steps to reach 1191the total stopping time

Highest value reached3,605,1883× the starting value

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

First steps1,201,729 → 3,605,188 → 1,802,594 → 901,297 → 2,703,892 → 1,351,946 → 675,973 → 2,027,920 → 1,013,960 → 506,980 → …

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

As a percentage & fraction

As a percentage120,172,900%

1,201,729% as a decimal12,017.29

1,201,729% of 1001,201,729

1,201,729% of 1,00012,017,290

As a fraction of 1001,201,729/100

Read another way

As seconds13 days, 21 hours and 48 minutes

As bytes1.146 MiB

As a 24-bit colour#125641

Keep nerding

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