Nerdulator> put something in

Recognised as Number

1,405,952

  • Positive
  • Even
  • Composite
  • 7 digits

1,405,952 is an even 7-digit integer and a composite number. It has 22 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,405,952
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^10 × 1,373
Distinct prime factors22, 1,373
Number of divisors22
Sum of divisors σ(n)2,812,578
Aliquot sum1,406,626sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)702,464integers below n that share no factor with it
Carmichael function λ(n)87,808the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 702,464
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1,024, 1,373, 2,746, 5,492, 10,984, 21,968, 43,936, 87,872, 175,744, 351,488, 702,976, 1,405,95222 in total

Arithmetic

Previous number1,405,951
Next number1,405,953
Double2,811,904
Cube2,779,146,761,334,161,408
Square root1,185.728468074≈irrational, shown to 9 decimal places
Cube root112.027204276≈
Negation-1,405,952
Reciprocal7.11261835 × 10^-7≈

Representations

Decimal1,405,952
Binary10101011101000000000021 bits
Octal5272000
Hexadecimal157400
Base 36U4U8
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and five thousand, nine hundred and fifty-two
Ordinalone million, four hundred and five thousand, nine hundred and fifty-second
Scientific notation1.405952 × 10^6
Engineering notation1.405952 × 10^6

In other bases

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

Bit-level

00000000000101010111010000000000
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 1010 trailing zeros
Power of twoNo
Bytes315 74 00
Gray code111111100111000000000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101010111010000000000
64-bit0000000000000000000000000000000000000000000101010111010000000000
One's complement11111111111010101000101111111111at 32 bits, every bit flipped
Bits reversed00000000001011101010100000000000at 32 bits
Rotated left by 100000000001010101110100000000000at 32 bits, wrapping
Shifted left by 11010101110100000000000= 2,811,904, no wrap
Shifted right by 110101011101000000000= 702,976, discarding the low bit
These bits as a double6.94632583 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,405,979+27
Previous prime1,405,939−13
Distance to nearest prime13
Nearest square below1,404,225
Nearest square above1,406,596

Powers & multiples

1,405,952 to the power 21,976,701,026,304
1,405,952 to the power 32,779,146,761,334,161,408
1,405,952 to the power 43,907,346,947,391,286,899,900,416
1,405,952 to the power 55,493,542,255,378,674,599,488,789,676,032
First ten multiples1,405,952, 2,811,904, 4,217,856, 5,623,808, 7,029,760, 8,435,712, 9,841,664, 11,247,616, 12,653,568, 14,059,520
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 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 8
Divisible by 10No, remainder 2
Divisible by 11No, remainder 9
Divisible by 12No, remainder 8
Divisible by 100No, remainder 52

Collatz (3n + 1) trajectory

Steps to reach 1137the total stopping time
Highest value reached1,405,952
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,405,952 → 702,976 → 351,488 → 175,744 → 87,872 → 43,936 → 21,968 → 10,984 → 5,492 → 2,746 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage140,595,200%
1,405,952% as a decimal14,059.52
1,405,952% of 1001,405,952
1,405,952% of 1,00014,059,520
As a fraction of 1001,405,952/100

Read another way

As bytes1.341 MiB
As a 24-bit colour#157400

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 “1405952” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.