Recognised as Number

1,401,233

Positive
Odd
Prime
7 digits

1,401,233 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,401,233

Digit count7

Digit sum14

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,401,233

Distinct prime factors11,401,233

Number of divisors2

Sum of divisors σ(n)1,401,234

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,401,232the 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,401,2332 in total

Arithmetic

Previous number1,401,232

Next number1,401,234

Double2,802,466

Half700,616.5

Square1,963,453,920,289

Cube2,751,256,427,088,316,337

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

Cube root111.901726083≈

Negation-1,401,233

Reciprocal7.13657186 × 10^-7≈

Representations

Decimal1,401,233

Binary10101011000011001000121 bits

Octal5260621

Hexadecimal156191

Base 36U175

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

In wordsone million, four hundred and one thousand, two hundred and thirty-three

Ordinalone million, four hundred and one thousand, two hundred and thirty-third

Scientific notation1.401233 × 10^6

Engineering notation1.401233 × 10^6

In other bases

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

Quinary324314413base 5; one hand: 9 digits

Septenary14624141base 7: 8 digits

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

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

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

Sexagesimal6:29:13:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101010110000110010001

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 odd

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes315 61 91

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

At each machine width

32-bit00000000000101010110000110010001

64-bit0000000000000000000000000000000000000000000101010110000110010001

One's complement11111111111010101001111001101110at 32 bits, every bit flipped

Bits reversed10001001100001101010100000000000at 32 bits

Rotated left by 100000000001010101100001100100010at 32 bits, wrapping

Shifted left by 11010101100001100100010= 2,802,466, no wrap

Shifted right by 110101011000011001000= 700,616, discarding the low bit

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

Nearest landmarks

Next prime1,401,247+14

Previous prime1,401,217−16

Distance to nearest prime0, it is prime

Nearest square below1,399,489

Nearest square above1,401,856

Powers & multiples

1,401,233 to the power 21,963,453,920,289

1,401,233 to the power 32,751,256,427,088,316,337

1,401,233 to the power 43,855,151,297,098,242,765,843,521

1,401,233 to the power 55,401,965,217,486,862,005,511,214,461,393

First ten multiples1,401,233, 2,802,466, 4,203,699, 5,604,932, 7,006,165, 8,407,398, 9,808,631, 11,209,864, 12,611,097, 14,012,330

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 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 1

Divisible by 9No, remainder 5

Divisible by 10No, remainder 3

Divisible by 11No, remainder 9

Divisible by 12No, remainder 5

Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 1106the total stopping time

Highest value reached4,203,7003× the starting value

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

First steps1,401,233 → 4,203,700 → 2,101,850 → 1,050,925 → 3,152,776 → 1,576,388 → 788,194 → 394,097 → 1,182,292 → 591,146 → …

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

As a percentage & fraction

As a percentage140,123,300%

1,401,233% as a decimal14,012.33

1,401,233% of 1001,401,233

1,401,233% of 1,00014,012,330

As a fraction of 1001,401,233/100

Read another way

As seconds16 days, 5 hours and 13 minutes

As bytes1.336 MiB

As a 24-bit colour#156191

Keep nerding

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