Base | Representation |
---|---|
bin | 110100100001100001101010… |
… | …101111111111010111110101 |
3 | 1010021220121100022012200112211 |
4 | 310201201222233333113311 |
5 | 220234220213333411201 |
6 | 2135144555213413421 |
7 | 66441236431400443 |
oct | 6441415257772765 |
9 | 1107817308180484 |
10 | 231002312013301 |
11 | 67671591a06094 |
12 | 21aa9966a9a271 |
13 | 9bb8569986b6a |
14 | 41088004d1b93 |
15 | 1ba8d78575651 |
hex | d2186abff5f5 |
231002312013301 has 16 divisors (see below), whose sum is σ = 246672704678400. Its totient is φ = 215801699485680.
The previous prime is 231002312013287. The next prime is 231002312013329. The reversal of 231002312013301 is 103310213200132.
It is a cyclic number.
It is not a de Polignac number, because 231002312013301 - 27 = 231002312013173 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231002312013401) 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 15 ways as a sum of consecutive naturals, for example, 1587766 + ... + 21552856.
It is an arithmetic number, because the mean of its divisors is an integer number (15417044042400).
Almost surely, 2231002312013301 is an apocalyptic number.
It is an amenable number.
231002312013301 is a deficient number, since it is larger than the sum of its proper divisors (15670392665099).
231002312013301 is a wasteful number, since it uses less digits than its factorization.
231002312013301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19976856.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 231002312013301 its reverse (103310213200132), we get a palindrome (334312525213433).
The spelling of 231002312013301 in words is "two hundred thirty-one trillion, two billion, three hundred twelve million, thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •