Base | Representation |
---|---|
bin | 10111000010011010110000… |
… | …000010101010010011100110 |
3 | 111021202012210212102100100202 |
4 | 113002122300002222103212 |
5 | 101240021340343001410 |
6 | 555254155325510502 |
7 | 30225134403635144 |
oct | 2702326002522346 |
9 | 437665725370322 |
10 | 101321232000230 |
11 | 2a3141030303a0 |
12 | b444897712432 |
13 | 446c721c34a18 |
14 | 1b03d8c142594 |
15 | baa8e76bcca5 |
hex | 5c26b00aa4e6 |
101321232000230 has 16 divisors (see below), whose sum is σ = 198958055564304. Its totient is φ = 36844084363680.
The previous prime is 101321232000223. The next prime is 101321232000239. The reversal of 101321232000230 is 32000232123101.
101321232000230 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101321232000239) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 460551054437 + ... + 460551054656.
It is an arithmetic number, because the mean of its divisors is an integer number (12434878472769).
Almost surely, 2101321232000230 is an apocalyptic number.
101321232000230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101321232000230 is a deficient number, since it is larger than the sum of its proper divisors (97636823564074).
101321232000230 is a wasteful number, since it uses less digits than its factorization.
101321232000230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 921102109111.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 101321232000230 its reverse (32000232123101), we get a palindrome (133321464123331).
The spelling of 101321232000230 in words is "one hundred one trillion, three hundred twenty-one billion, two hundred thirty-two million, two hundred thirty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •