Recognised as Number

1,470,071

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,470,071

Digit count7

Digit sum20

Digit product0zero, because one of the digits is zero

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,470,071

Distinct prime factors11,470,071

Number of divisors2

Sum of divisors σ(n)1,470,072

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,470,070the 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,470,0712 in total

Arithmetic

Previous number1,470,070

Next number1,470,072

Double2,940,142

Half735,035.5

Square2,161,108,745,041

Cube3,176,983,293,931,167,911

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

Cube root113.704967079≈

Negation-1,470,071

Reciprocal6.80239254 × 10^-7≈

Representations

Decimal1,470,071

Binary10110011011100111011121 bits

Octal5467167

Hexadecimal166E77

Base 36VIBB

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

In wordsone million, four hundred and seventy thousand and seventy-one

Ordinalone million, four hundred and seventy thousand and seventy-first

Scientific notation1.470071 × 10^6

Engineering notation1.470071 × 10^6

In other bases

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

Quinary334020241base 5; one hand: 9 digits

Septenary15331631base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101100110111001110111

Bit length21 bitsto write the magnitude

Set bits14the population count, or Hamming weight

Zero bits7within that length

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

Bytes316 6e 77

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

At each machine width

32-bit00000000000101100110111001110111

64-bit0000000000000000000000000000000000000000000101100110111001110111

One's complement11111111111010011001000110001000at 32 bits, every bit flipped

Bits reversed11101110011101100110100000000000at 32 bits

Rotated left by 100000000001011001101110011101110at 32 bits, wrapping

Shifted left by 11011001101110011101110= 2,940,142, no wrap

Shifted right by 110110011011100111011= 735,035, discarding the low bit

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

Nearest landmarks

Next prime1,470,149+78

Previous prime1,470,067−4

Distance to nearest prime0, it is prime

Nearest square below1,468,944

Nearest square above1,471,369

Powers & multiples

1,470,071 to the power 22,161,108,745,041

1,470,071 to the power 33,176,983,293,931,167,911

1,470,071 to the power 44,670,391,007,892,685,942,091,681

1,470,071 to the power 56,865,806,379,363,808,715,576,659,579,351

First ten multiples1,470,071, 2,940,142, 4,410,213, 5,880,284, 7,350,355, 8,820,426, 10,290,497, 11,760,568, 13,230,639, 14,700,710

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 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 7

Divisible by 9No, remainder 2

Divisible by 10No, remainder 1

Divisible by 11No, remainder 9

Divisible by 12No, remainder 11

Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 1181the total stopping time

Highest value reached9,922,9846× the starting value

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

First steps1,470,071 → 4,410,214 → 2,205,107 → 6,615,322 → 3,307,661 → 9,922,984 → 4,961,492 → 2,480,746 → 1,240,373 → 3,721,120 → …

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

As a percentage & fraction

As a percentage147,007,100%

1,470,071% as a decimal14,700.71

1,470,071% of 1001,470,071

1,470,071% of 1,00014,700,710

As a fraction of 1001,470,071/100

Read another way

As seconds17 days, 21 minutes and 11 seconds

As bytes1.402 MiB

As a 24-bit colour#166E77

Keep nerding

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