Base | Representation |
---|---|
bin | 1101110011000010100110… |
… | …00110111111010011100000 |
3 | 10222102120112110212110202101 |
4 | 12321201103012333103200 |
5 | 12434101424042220112 |
6 | 144310252145100144 |
7 | 6251032223646664 |
oct | 671412306772340 |
9 | 128376473773671 |
10 | 30341043320032 |
11 | 9738622a68155 |
12 | 34a036a027654 |
13 | 13c11c0517333 |
14 | 76c72b4828a4 |
15 | 37939085b757 |
hex | 1b98531bf4e0 |
30341043320032 has 12 divisors (see below), whose sum is σ = 59733929036376. Its totient is φ = 15170521660000.
The previous prime is 30341043319999. The next prime is 30341043320033. The reversal of 30341043320032 is 23002334014303.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30341043320033) by changing a digit.
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 as a sum of consecutive naturals, namely, 474078801844 + ... + 474078801907.
It is an arithmetic number, because the mean of its divisors is an integer number (4977827419698).
Almost surely, 230341043320032 is an apocalyptic number.
30341043320032 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
30341043320032 is a deficient number, since it is larger than the sum of its proper divisors (29392885716344).
30341043320032 is an equidigital number, since it uses as much as digits as its factorization.
30341043320032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 948157603761 (or 948157603753 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 28.
Adding to 30341043320032 its reverse (23002334014303), we get a palindrome (53343377334335).
The spelling of 30341043320032 in words is "thirty trillion, three hundred forty-one billion, forty-three million, three hundred twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •