Base | Representation |
---|---|
bin | 1101101111110111101011… |
… | …10000110001000110111111 |
3 | 10222001011100020111101212020 |
4 | 12313323311300301012333 |
5 | 12430310321333444411 |
6 | 144144234132411223 |
7 | 6240124460532363 |
oct | 667736560610677 |
9 | 128034306441766 |
10 | 30232103031231 |
11 | 96a63aa014822 |
12 | 3483226176b13 |
13 | 13b3b4b732c9a |
14 | 767354d112a3 |
15 | 3766167dc606 |
hex | 1b7ef5c311bf |
30232103031231 has 32 divisors (see below), whose sum is σ = 41452974689280. Its totient is φ = 19587855974400.
The previous prime is 30232103031211. The next prime is 30232103031241. The reversal of 30232103031231 is 13213030123203.
It is not a de Polignac number, because 30232103031231 - 223 = 30232094642623 is a prime.
It is a super-2 number, since 2×302321030312312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30232103031211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26321191 + ... + 27445751.
It is an arithmetic number, because the mean of its divisors is an integer number (1295405459040).
Almost surely, 230232103031231 is an apocalyptic number.
30232103031231 is a deficient number, since it is larger than the sum of its proper divisors (11220871658049).
30232103031231 is a wasteful number, since it uses less digits than its factorization.
30232103031231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1125647.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 30232103031231 its reverse (13213030123203), we get a palindrome (43445133154434).
The spelling of 30232103031231 in words is "thirty trillion, two hundred thirty-two billion, one hundred three million, thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •