Base | Representation |
---|---|
bin | 11100000011110011… |
… | …10101110011010011 |
3 | 1102212212012000110020 |
4 | 32001321311303103 |
5 | 221322431402311 |
6 | 10530452434523 |
7 | 1042210436556 |
oct | 160171656323 |
9 | 42785160406 |
10 | 15064325331 |
11 | 6430467650 |
12 | 2b05018a43 |
13 | 1560c7b993 |
14 | a2c9aa69d |
15 | 5d27bdc06 |
hex | 381e75cd3 |
15064325331 has 32 divisors (see below), whose sum is σ = 22200998400. Its totient is φ = 9009914880.
The previous prime is 15064325303. The next prime is 15064325357. The reversal of 15064325331 is 13352346051.
It is not a de Polignac number, because 15064325331 - 214 = 15064308947 is a prime.
It is a super-2 number, since 2×150643253312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 15064325292 and 15064325301.
It is not an unprimeable number, because it can be changed into a prime (15064325231) 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 31 ways as a sum of consecutive naturals, for example, 1142605 + ... + 1155713.
It is an arithmetic number, because the mean of its divisors is an integer number (693781200).
Almost surely, 215064325331 is an apocalyptic number.
15064325331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
15064325331 is a deficient number, since it is larger than the sum of its proper divisors (7136673069).
15064325331 is a wasteful number, since it uses less digits than its factorization.
15064325331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13579.
The product of its (nonzero) digits is 32400, while the sum is 33.
The spelling of 15064325331 in words is "fifteen billion, sixty-four million, three hundred twenty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •