Base | Representation |
---|---|
bin | 1101110010100100101111… |
… | …01000101001010011111111 |
3 | 10222101001011022020011021020 |
4 | 12321102113220221103333 |
5 | 12433321111324434401 |
6 | 144255041350235223 |
7 | 6246624044354421 |
oct | 671222750512377 |
9 | 128331138204236 |
10 | 30325013124351 |
11 | 9731847378950 |
12 | 3499235655b13 |
13 | 13bc83741b04a |
14 | 76ba4a4d0811 |
15 | 378c5339dd36 |
hex | 1b9497a294ff |
30325013124351 has 16 divisors (see below), whose sum is σ = 45134903256960. Its totient is φ = 17951381975520.
The previous prime is 30325013124319. The next prime is 30325013124383. The reversal of 30325013124351 is 15342131052303.
It is an interprime number because it is at equal distance from previous prime (30325013124319) and next prime (30325013124383).
It is not a de Polignac number, because 30325013124351 - 25 = 30325013124319 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30325013124851) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10685344996 + ... + 10685347833.
It is an arithmetic number, because the mean of its divisors is an integer number (2820931453560).
Almost surely, 230325013124351 is an apocalyptic number.
30325013124351 is a deficient number, since it is larger than the sum of its proper divisors (14809890132609).
30325013124351 is a wasteful number, since it uses less digits than its factorization.
30325013124351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21370692886.
The product of its (nonzero) digits is 32400, while the sum is 33.
Adding to 30325013124351 its reverse (15342131052303), we get a palindrome (45667144176654).
The spelling of 30325013124351 in words is "thirty trillion, three hundred twenty-five billion, thirteen million, one hundred twenty-four thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •