Recognised as Number

1,210,369

Positive
Odd
Prime
7 digits

1,210,369 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,210,369

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,210,369

Distinct prime factors11,210,369

Number of divisors2

Sum of divisors σ(n)1,210,370

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,210,368the 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,210,3692 in total

Arithmetic

Previous number1,210,368

Next number1,210,370

Double2,420,738

Half605,184.5

Square1,464,993,116,161

Cube1,773,182,253,014,673,409

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

Cube root106.571054731≈

Negation-1,210,369

Reciprocal8.26194326 × 10^-7≈

Representations

Decimal1,210,369

Binary10010011110000000000121 bits

Octal4474001

Hexadecimal127801

Base 36PXXD

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

In wordsone million, two hundred and ten thousand, three hundred and sixty-nine

Ordinalone million, two hundred and ten thousand, three hundred and sixty-ninth

Scientific notation1.210369 × 10^6

Engineering notation1.210369 × 10^6

In other bases

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

Quinary302212434base 5; one hand: 9 digits

Septenary13200526base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100100111100000000001

Bit length21 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits14within that length

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

Bytes312 78 01

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

At each machine width

32-bit00000000000100100111100000000001

64-bit0000000000000000000000000000000000000000000100100111100000000001

One's complement11111111111011011000011111111110at 32 bits, every bit flipped

Bits reversed10000000000111100100100000000000at 32 bits

Rotated left by 100000000001001001111000000000010at 32 bits, wrapping

Shifted left by 11001001111000000000010= 2,420,738, no wrap

Shifted right by 110010011110000000000= 605,184, discarding the low bit

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

Nearest landmarks

Next prime1,210,379+10

Previous prime1,210,351−18

Distance to nearest prime0, it is prime

Nearest square below1,210,000

Nearest square above1,212,201

Powers & multiples

1,210,369 to the power 21,464,993,116,161

1,210,369 to the power 31,773,182,253,014,673,409

1,210,369 to the power 42,146,204,830,399,117,239,377,921

1,210,369 to the power 52,597,699,794,365,349,133,908,614,862,849

First ten multiples1,210,369, 2,420,738, 3,631,107, 4,841,476, 6,051,845, 7,262,214, 8,472,583, 9,682,952, 10,893,321, 12,103,690

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 6

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 9

Divisible by 11No, remainder 6

Divisible by 12No, remainder 1

Divisible by 100No, remainder 69

Collatz (3n + 1) trajectory

Steps to reach 1173the total stopping time

Highest value reached4,197,4003× the starting value

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

First steps1,210,369 → 3,631,108 → 1,815,554 → 907,777 → 2,723,332 → 1,361,666 → 680,833 → 2,042,500 → 1,021,250 → 510,625 → …

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

As a percentage & fraction

As a percentage121,036,900%

1,210,369% as a decimal12,103.69

1,210,369% of 1001,210,369

1,210,369% of 1,00012,103,690

As a fraction of 1001,210,369/100

Read another way

As seconds14 days, 12 minutes and 49 seconds

As bytes1.154 MiB

As a 24-bit colour#127801

Keep nerding

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