Base | Representation |
---|---|
bin | 1101110010010000110101… |
… | …00000111001001100010011 |
3 | 10222100000120100202200000001 |
4 | 12321020122200321030103 |
5 | 12433132213421140101 |
6 | 144250112545310431 |
7 | 6246065131351150 |
oct | 671103240711423 |
9 | 128300510680001 |
10 | 30314324005651 |
11 | 9728261676854 |
12 | 3497151935417 |
13 | 13bb822a3123a |
14 | 76b314a27227 |
15 | 378829c6c901 |
hex | 1b921a839313 |
30314324005651 has 8 divisors (see below), whose sum is σ = 34662033469440. Its totient is φ = 25970887479048.
The previous prime is 30314324005601. The next prime is 30314324005657. The reversal of 30314324005651 is 15650042341303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30314324005651 - 211 = 30314324003603 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 30314324005651.
It is not an unprimeable number, because it can be changed into a prime (30314324005657) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1068219091 + ... + 1068247468.
It is an arithmetic number, because the mean of its divisors is an integer number (4332754183680).
Almost surely, 230314324005651 is an apocalyptic number.
30314324005651 is a deficient number, since it is larger than the sum of its proper divisors (4347709463789).
30314324005651 is a wasteful number, since it uses less digits than its factorization.
30314324005651 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2136468593.
The product of its (nonzero) digits is 129600, while the sum is 37.
Adding to 30314324005651 its reverse (15650042341303), we get a palindrome (45964366346954).
The spelling of 30314324005651 in words is "thirty trillion, three hundred fourteen billion, three hundred twenty-four million, five thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •