Base | Representation |
---|---|
bin | 1101101010111001001110… |
… | …0000010111011011100010 |
3 | 1222012220111221100200222010 |
4 | 3122232103200113123202 |
5 | 3432230044204212114 |
6 | 51544540230053350 |
7 | 3110631264040140 |
oct | 332562340273342 |
9 | 58186457320863 |
10 | 15030565304034 |
11 | 48754772a4925 |
12 | 1829035aaa256 |
13 | 8504b7752bb7 |
14 | 39d6aa034590 |
15 | 1b0ea5c05c59 |
hex | dab938176e2 |
15030565304034 has 32 divisors (see below), whose sum is σ = 34437182576256. Its totient is φ = 4284246637440.
The previous prime is 15030565303997. The next prime is 15030565304057. The reversal of 15030565304034 is 43040356503051.
It is a junction number, because it is equal to n+sod(n) for n = 15030565303983 and 15030565304001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 425006787 + ... + 425042150.
It is an arithmetic number, because the mean of its divisors is an integer number (1076161955508).
Almost surely, 215030565304034 is an apocalyptic number.
15030565304034 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
15030565304034 is an abundant number, since it is smaller than the sum of its proper divisors (19406617272222).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15030565304034 is a wasteful number, since it uses less digits than its factorization.
15030565304034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 850049370.
The product of its (nonzero) digits is 324000, while the sum is 39.
The spelling of 15030565304034 in words is "fifteen trillion, thirty billion, five hundred sixty-five million, three hundred four thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •