Recognised as Number
5,364,000,000,011
- Positive
- Odd
- Prime
- 13 digits
5,364,000,000,011 is an odd 13-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 value5,364,000,000,011
Digit count13
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 factorisation5,364,000,000,011
Distinct prime factors15,364,000,000,011
Number of divisors2
Sum of divisors σ(n)5,364,000,000,012
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,364,000,000,010integers below n that share no factor with it
Carmichael function λ(n)5,364,000,000,010the 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,364,000,000,0112 in total
Arithmetic
Previous number5,364,000,000,010
Next number5,364,000,000,012
Double10,728,000,000,022
Square28,772,496,000,118,008,000,000,121
Cube154,335,668,544,949,492,368,001,947,132,000,001,331
Square root2,316,031.08787663≈irrational, shown to 9 decimal places
Cube root17,505.032566237≈
Negation-5,364,000,000,011
Reciprocal1.86428039 × 10^-13≈
Representations
Decimal5,364,000,000,011
Binary100111000001110011101010000100010000000101143 bits
Octal116034724104013
Hexadecimal4E0E750880B
Base 361WG6R3SWB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive trillion, three hundred and sixty-four billion and eleven
Ordinalfive trillion, three hundred and sixty-four billion and eleventh
Scientific notation5.364 × 10^12
Engineering notation5.364 × 10^12
In other bases
Ternary200222210102101100000101002base 3; the most digit-efficient integer base after e: 27 digits
Quinary1200340433000000021base 5; one hand: 19 digits
Septenary1062351630466022base 7: 16 digits
Nonary20883371300332base 9; each digit is two ternary digits: 14 digits
Duodecimal7276b48b680bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimala9aca0000bbase 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal1:54:58:8:53:20:0:11base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary1T01000T1011T10110000010101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1010010000100111011010100011001100000011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000001001110000011100111010100001000100000001011
Bit length43 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits26within that length
Bit parityodd17 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 42worth 4,398,046,511,104
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes604 e0 e7 50 88 0b
Gray code1101001000010010100111110001100110000001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000001001110000011100111010100001000100000001011
One's complement1111111111111111111110110001111100011000101011110111011111110100at 64 bits, every bit flipped
Bits reversed1101000000010001000010101110011100000111001000000000000000000000at 64 bits
Rotated left by 10000000000000000000010011100000111001110101000010001000000010110at 64 bits, wrapping
Shifted left by 110011100000111001110101000010001000000010110= 10,728,000,000,022, no wrap
Shifted right by 1100111000001110011101010000100010000000101= 2,682,000,000,005, discarding the low bit
These bits as a double2.65016812 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime0, it is prime
Nearest square below5,363,999,592,961
Nearest square above5,364,004,225,024
Powers & multiples
5,364,000,000,011 to the power 228,772,496,000,118,008,000,000,121
5,364,000,000,011 to the power 3154,335,668,544,949,492,368,001,947,132,000,001,331
5,364,000,000,011 to the power 4827856526076806769415956888832… (51 digits)
5,364,000,000,011 to the power 5444062240588509793293403762615… (64 digits)
First ten multiples5,364,000,000,011, 10,728,000,000,022, 16,092,000,000,033, 21,456,000,000,044, 26,820,000,000,055, 32,184,000,000,066, 37,548,000,000,077, 42,912,000,000,088, 48,276,000,000,099, 53,640,000,000,110
Powers of twoBetween 2^42 (4,398,046,511,104) and 2^43 (8,796,093,022,208)
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 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 11
Collatz (3n + 1) trajectory
Steps to reach 1420the total stopping time
Highest value reached24,138,000,000,0524× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,364,000,000,011 → 16,092,000,000,034 → 8,046,000,000,017 → 24,138,000,000,052 → 12,069,000,000,026 → 6,034,500,000,013 → 18,103,500,000,040 → 9,051,750,000,020 → 4,525,875,000,010 → 2,262,937,500,005 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage536,400,000,001,100%
5,364,000,000,011% as a decimal53,640,000,000.11
5,364,000,000,011% of 1005,364,000,000,011
5,364,000,000,011% of 1,00053,640,000,000,110
As a fraction of 1005,364,000,000,011/100
Read another way
As seconds169,974 years, 329 days and 20 hours
As bytes4.879 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 5,364,000,000,011
Nearby primes
Also reads as
5364000000011 (identifier)
- 13 characters
- Checksum fails
5364000000011 matches the shape of ISBN-13 / EAN-13, Luhn (cards, IMEI). No check digit validates. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
ISBN-13 / EAN-13Check digit does not matchmod 10 with alternating weights 1 and 3
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Nerdulate something else
Nothing in mind? Surprise me · today’s page