Base | Representation |
---|---|
bin | 110100110001111100000111… |
… | …011000011101100100111111 |
3 | 1010102220102200020112010012212 |
4 | 310301330013120131210333 |
5 | 220411210143123100111 |
6 | 2141411052420051035 |
7 | 66615566165216045 |
oct | 6461740730354477 |
9 | 1112812606463185 |
10 | 232130221300031 |
11 | 67a669683352aa |
12 | 22050485533a7b |
13 | 9c6aa2a93b382 |
14 | 414723c494395 |
15 | 1bc838e31e98b |
hex | d31f0761d93f |
232130221300031 has 16 divisors (see below), whose sum is σ = 240899854187520. Its totient is φ = 223535409420960.
The previous prime is 232130221300007. The next prime is 232130221300057. The reversal of 232130221300031 is 130003122031232.
It is a cyclic number.
It is not a de Polignac number, because 232130221300031 - 214 = 232130221283647 is a prime.
It is a super-2 number, since 2×2321302213000312 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232130221300001) 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, 56849495 + ... + 60795768.
It is an arithmetic number, because the mean of its divisors is an integer number (15056240886720).
Almost surely, 2232130221300031 is an apocalyptic number.
232130221300031 is a deficient number, since it is larger than the sum of its proper divisors (8769632887489).
232130221300031 is a wasteful number, since it uses less digits than its factorization.
232130221300031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117646006.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 232130221300031 its reverse (130003122031232), we get a palindrome (362133343331263).
The spelling of 232130221300031 in words is "two hundred thirty-two trillion, one hundred thirty billion, two hundred twenty-one million, three hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •