Recognised as Number

1,401,705

Positive
Odd
Composite
7 digits

1,401,705 is an odd 7-digit integer and a composite number. It has 20 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,401,705

Digit count7

Digit sum18

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^4 × 5 × 3,461

Distinct prime factors33, 5, 3,461

Number of divisors20

Sum of divisors σ(n)2,513,412

Aliquot sum1,111,707sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)93,420the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 747,360

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 5, 9, 15, 27, 45, 81, 135, 405, 3,461, 10,383, 17,305, 31,149, 51,915, 93,447, 155,745, 280,341, 467,235, 1,401,70520 in total

Arithmetic

Previous number1,401,704

Next number1,401,706

Double2,803,410

Half700,852.5

Square1,964,776,907,025

Cube2,754,037,614,461,477,625

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

Cube root111.914289229≈

Negation-1,401,705

Reciprocal7.13416874 × 10^-7≈

Representations

Decimal1,401,705

Binary10101011000110110100121 bits

Octal5261551

Hexadecimal156369

Base 36U1K9

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

In wordsone million, four hundred and one thousand, seven hundred and five

Ordinalone million, four hundred and one thousand, seven hundred and fifth

Scientific notation1.401705 × 10^6

Engineering notation1.401705 × 10^6

In other bases

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

Quinary324323310base 5; one hand: 9 digits

Septenary14625414base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101010110001101101001

Bit length21 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits10within that length

Bit parityodd11 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 63 69

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

At each machine width

32-bit00000000000101010110001101101001

64-bit0000000000000000000000000000000000000000000101010110001101101001

One's complement11111111111010101001110010010110at 32 bits, every bit flipped

Bits reversed10010110110001101010100000000000at 32 bits

Rotated left by 100000000001010101100011011010010at 32 bits, wrapping

Shifted left by 11010101100011011010010= 2,803,410, no wrap

Shifted right by 110101011000110110100= 700,852, discarding the low bit

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

Nearest landmarks

Next prime1,401,713+8

Previous prime1,401,703−2

Distance to nearest prime2

Nearest square below1,399,489

Nearest square above1,401,856

Powers & multiples

1,401,705 to the power 21,964,776,907,025

1,401,705 to the power 32,754,037,614,461,477,625

1,401,705 to the power 43,860,348,294,378,725,494,350,625

1,401,705 to the power 55,411,069,505,972,131,419,058,742,815,625

First ten multiples1,401,705, 2,803,410, 4,205,115, 5,606,820, 7,008,525, 8,410,230, 9,811,935, 11,213,640, 12,615,345, 14,017,050

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 1

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 5

Divisible by 11No, remainder 8

Divisible by 12No, remainder 9

Divisible by 100No, remainder 5

Collatz (3n + 1) trajectory

Steps to reach 1137the total stopping time

Highest value reached10,644,2087× the starting value

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

First steps1,401,705 → 4,205,116 → 2,102,558 → 1,051,279 → 3,153,838 → 1,576,919 → 4,730,758 → 2,365,379 → 7,096,138 → 3,548,069 → …

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

As a percentage & fraction

As a percentage140,170,500%

1,401,705% as a decimal14,017.05

1,401,705% of 1001,401,705

1,401,705% of 1,00014,017,050

As a fraction of 1001,401,705/100

Read another way

As seconds16 days, 5 hours and 21 minutes

As bytes1.337 MiB

As a 24-bit colour#156369

Keep nerding

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