Recognised as Number

1,407,061

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,407,061

Digit count7

Digit sum19

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,407,061

Distinct prime factors11,407,061

Number of divisors2

Sum of divisors σ(n)1,407,062

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,407,060the 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,407,0612 in total

Arithmetic

Previous number1,407,060

Next number1,407,062

Double2,814,122

Half703,530.5

Square1,979,820,657,721

Cube2,785,728,434,473,567,981

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

Cube root112.056651824≈

Negation-1,407,061

Reciprocal7.10701242 × 10^-7≈

Representations

Decimal1,407,061

Binary10101011110000101010121 bits

Octal5274125

Hexadecimal157855

Base 36U5P1

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

In wordsone million, four hundred and seven thousand and sixty-one

Ordinalone million, four hundred and seven thousand and sixty-first

Scientific notation1.407061 × 10^6

Engineering notation1.407061 × 10^6

In other bases

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

Quinary330011221base 5; one hand: 9 digits

Septenary14650135base 7: 8 digits

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

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

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

Sexagesimal6:30:51:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101010111100001010101

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 78 55

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

At each machine width

32-bit00000000000101010111100001010101

64-bit0000000000000000000000000000000000000000000101010111100001010101

One's complement11111111111010101000011110101010at 32 bits, every bit flipped

Bits reversed10101010000111101010100000000000at 32 bits

Rotated left by 100000000001010101111000010101010at 32 bits, wrapping

Shifted left by 11010101111000010101010= 2,814,122, no wrap

Shifted right by 110101011110000101010= 703,530, discarding the low bit

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

Nearest landmarks

Next prime1,407,101+40

Previous prime1,407,053−8

Distance to nearest prime0, it is prime

Nearest square below1,406,596

Nearest square above1,408,969

Powers & multiples

1,407,061 to the power 21,979,820,657,721

1,407,061 to the power 32,785,728,434,473,567,981

1,407,061 to the power 43,919,689,836,738,813,036,913,841

1,407,061 to the power 55,515,242,701,371,551,010,533,026,031,301

First ten multiples1,407,061, 2,814,122, 4,221,183, 5,628,244, 7,035,305, 8,442,366, 9,849,427, 11,256,488, 12,663,549, 14,070,610

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 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 1

Divisible by 11No, remainder 7

Divisible by 12No, remainder 1

Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 1168the total stopping time

Highest value reached4,221,1843× the starting value

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

First steps1,407,061 → 4,221,184 → 2,110,592 → 1,055,296 → 527,648 → 263,824 → 131,912 → 65,956 → 32,978 → 16,489 → …

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

As a percentage & fraction

As a percentage140,706,100%

1,407,061% as a decimal14,070.61

1,407,061% of 1001,407,061

1,407,061% of 1,00014,070,610

As a fraction of 1001,407,061/100

Read another way

As seconds16 days, 6 hours and 51 minutes

As bytes1.342 MiB

As a 24-bit colour#157855

Keep nerding

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