Base | Representation |
---|---|
bin | 1001111111101011… |
… | …10011011000100001 |
3 | 111211222010212120010 |
4 | 10333311303120201 |
5 | 41442201123001 |
6 | 2244244435133 |
7 | 246655360554 |
oct | 47765633041 |
9 | 14758125503 |
10 | 5366036001 |
11 | 2303a952a7 |
12 | 10590a8aa9 |
13 | 67693ab41 |
14 | 38c94469b |
15 | 21615b8d6 |
hex | 13fd73621 |
5366036001 has 4 divisors (see below), whose sum is σ = 7154714672. Its totient is φ = 3577357332.
The previous prime is 5366035979. The next prime is 5366036003. The reversal of 5366036001 is 1006306635.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 5366036001 - 26 = 5366035937 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5366036001.
It is not an unprimeable number, because it can be changed into a prime (5366036003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 894339331 + ... + 894339336.
It is an arithmetic number, because the mean of its divisors is an integer number (1788678668).
Almost surely, 25366036001 is an apocalyptic number.
It is an amenable number.
5366036001 is a deficient number, since it is larger than the sum of its proper divisors (1788678671).
5366036001 is a wasteful number, since it uses less digits than its factorization.
5366036001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1788678670.
The product of its (nonzero) digits is 9720, while the sum is 30.
The square root of 5366036001 is about 73253.2320174339. The cubic root of 5366036001 is about 1750.7247067559.
The spelling of 5366036001 in words is "five billion, three hundred sixty-six million, thirty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •