Nerdulator> put something in

Recognised as Number

5,406,733

  • Positive
  • Odd
  • Prime
  • 7 digits

5,406,733 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 value5,406,733
Digit count7
Digit sum28
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 numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5,406,733
Distinct prime factors15,406,733
Number of divisors2
Sum of divisors σ(n)5,406,734
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,406,732integers below n that share no factor with it
Carmichael function λ(n)5,406,732the 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, 5,406,7332 in total

Arithmetic

Previous number5,406,732
Next number5,406,734
Cube158,053,737,544,510,834,837
Square root2,325.238267361≈irrational, shown to 9 decimal places
Cube root175.513950347≈
Negation-5,406,733
Reciprocal1.84954574 × 10^-7≈

Representations

Decimal5,406,733
Binary1010010100000000000110123 bits
Octal24500015
Hexadecimal52800D
Base 3637VV1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, four hundred and six thousand, seven hundred and thirty-three
Ordinalfive million, four hundred and six thousand, seven hundred and thirty-third
Scientific notation5.406733 × 10^6
Engineering notation5.406733 × 10^6

In other bases

Ternary101011200122101base 3; the most digit-efficient integer base after e: 15 digits
Quinary2341003413base 5; one hand: 10 digits
Septenary63646033base 7: 8 digits
Nonary11150571base 9; each digit is two ternary digits: 8 digits
Duodecimal1988a91base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1dfggdbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal25:1:52:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1011TTT01T0T101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101111000000000011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010100101000000000001101
Bit length23 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits16within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes352 80 0d
Gray code11110111100000000001011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010100101000000000001101
64-bit0000000000000000000000000000000000000000010100101000000000001101
One's complement11111111101011010111111111110010at 32 bits, every bit flipped
Bits reversed10110000000000010100101000000000at 32 bits
Rotated left by 100000000101001010000000000011010at 32 bits, wrapping
Shifted left by 1101001010000000000011010= 10,813,466, no wrap
Shifted right by 11010010100000000000110= 2,703,366, discarding the low bit
These bits as a double2.67128103 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime5,406,749+16
Previous prime5,406,719−14
Distance to nearest prime0, it is prime
Nearest square below5,405,625
Nearest square above5,410,276

Powers & multiples

5,406,733 to the power 229,232,761,733,289
5,406,733 to the power 3158,053,737,544,510,834,837
5,406,733 to the power 4854,554,358,555,245,699,570,757,521
5,406,733 to the power 54,620,347,250,694,479,246,977,300,523,788,893
First ten multiples5,406,733, 10,813,466, 16,220,199, 21,626,932, 27,033,665, 32,440,398, 37,847,131, 43,253,864, 48,660,597, 54,067,330
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1232the total stopping time
Highest value reached16,220,2003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,406,733 → 16,220,200 → 8,110,100 → 4,055,050 → 2,027,525 → 6,082,576 → 3,041,288 → 1,520,644 → 760,322 → 380,161 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage540,673,300%
5,406,733% as a decimal54,067.33
5,406,733% of 1005,406,733
5,406,733% of 1,00054,067,330
As a fraction of 1005,406,733/100

Read another way

As bytes5.156 MiB
As a 24-bit colour#52800D

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