Base | Representation |
---|---|
bin | 1001111100001001… |
… | …10101101001100011 |
3 | 111202220102101011201 |
4 | 10332010311221203 |
5 | 41412111014021 |
6 | 2241310022031 |
7 | 246145563403 |
oct | 47604655143 |
9 | 14686371151 |
10 | 5336423011 |
11 | 22992a9657 |
12 | 104b1a7917 |
13 | 67077006a |
14 | 388a36803 |
15 | 21375c591 |
hex | 13e135a63 |
5336423011 has 8 divisors (see below), whose sum is σ = 5626771920. Its totient is φ = 5047022592.
The previous prime is 5336423009. The next prime is 5336423051. The reversal of 5336423011 is 1103246335.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5336423011 - 21 = 5336423009 is a prime.
It is a super-2 number, since 2×53364230112 = 56954821104660612242, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5336423051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 225550 + ... + 248083.
It is an arithmetic number, because the mean of its divisors is an integer number (703346490).
Almost surely, 25336423011 is an apocalyptic number.
5336423011 is a deficient number, since it is larger than the sum of its proper divisors (290348909).
5336423011 is a wasteful number, since it uses less digits than its factorization.
5336423011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 474245.
The product of its (nonzero) digits is 6480, while the sum is 28.
The square root of 5336423011 is about 73050.8248481836. The cubic root of 5336423011 is about 1747.4982495993.
Adding to 5336423011 its reverse (1103246335), we get a palindrome (6439669346).
The spelling of 5336423011 in words is "five billion, three hundred thirty-six million, four hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •