Nerdulator> put something in

Recognised as Number

1,407,062

  • Positive
  • Even
  • Composite
  • 7 digits

1,407,062 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,407,062
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 factorisation2 × 703,531
Distinct prime factors22, 703,531
Number of divisors4
Sum of divisors σ(n)2,110,596
Aliquot sum703,534sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)703,530integers below n that share no factor with it
Carmichael function λ(n)703,530the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 703,531, 1,407,0624 in total

Arithmetic

Previous number1,407,061
Next number1,407,063
Double2,814,124
Cube2,785,734,373,939,762,328
Square root1,186.196442416≈irrational, shown to 9 decimal places
Cube root112.056678371≈
Negation-1,407,062
Reciprocal7.10700737 × 10^-7≈

Representations

Decimal1,407,062
Binary10101011110000101011021 bits
Octal5274126
Hexadecimal157856
Base 36U5P2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and seven thousand and sixty-two
Ordinalone million, four hundred and seven thousand and sixty-second
Scientific notation1.407062 × 10^6
Engineering notation1.407062 × 10^6

In other bases

Ternary2122111010102base 3; the most digit-efficient integer base after e: 13 digits
Quinary330011222base 5; one hand: 9 digits
Septenary14650136base 7: 8 digits
Nonary2574112base 9; each digit is two ternary digits: 7 digits
Duodecimal57a332base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8fhd2base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:30:51:2base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T11101011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101000100110101010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101010111100001010110
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes315 78 56
Gray code111111100010001111101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101010111100001010110
64-bit0000000000000000000000000000000000000000000101010111100001010110
One's complement11111111111010101000011110101001at 32 bits, every bit flipped
Bits reversed01101010000111101010100000000000at 32 bits
Rotated left by 100000000001010101111000010101100at 32 bits, wrapping
Shifted left by 11010101111000010101100= 2,814,124, no wrap
Shifted right by 110101011110000101011= 703,531, discarding the low bit
These bits as a double6.95180996 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,407,101+39
Previous prime1,407,061−1
Distance to nearest prime1
Nearest square below1,406,596
Nearest square above1,408,969

Powers & multiples

1,407,062 to the power 21,979,823,471,844
1,407,062 to the power 32,785,734,373,939,762,328
1,407,062 to the power 43,919,700,979,664,429,860,760,336
1,407,062 to the power 55,515,262,299,848,592,008,741,159,892,832
First ten multiples1,407,062, 2,814,124, 4,221,186, 5,628,248, 7,035,310, 8,442,372, 9,849,434, 11,256,496, 12,663,558, 14,070,620
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 8
Divisible by 12No, remainder 2
Divisible by 100No, remainder 62

Collatz (3n + 1) trajectory

Steps to reach 1168the total stopping time
Highest value reached3,165,8922× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,407,062 → 703,531 → 2,110,594 → 1,055,297 → 3,165,892 → 1,582,946 → 791,473 → 2,374,420 → 1,187,210 → 593,605 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage140,706,200%
1,407,062% as a decimal14,070.62
1,407,062% of 1001,407,062
1,407,062% of 1,00014,070,620
As a fraction of 1001,407,062/100

Read another way

As bytes1.342 MiB
As a 24-bit colour#157856

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “1407062” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.