Base | Representation |
---|---|
bin | 1101011001001100001… |
… | …1000011111100001101 |
3 | 210222221002100101001120 |
4 | 3112103003003330031 |
5 | 12232221140220023 |
6 | 253412344231153 |
7 | 22424046310014 |
oct | 3262303037415 |
9 | 728832311046 |
10 | 230100320013 |
11 | 896486a5133 |
12 | 3871816b4b9 |
13 | 1891040a615 |
14 | b1cb9a1a7b |
15 | 5ebacb78e3 |
hex | 35930c3f0d |
230100320013 has 16 divisors (see below), whose sum is σ = 308429009856. Its totient is φ = 152586282240.
The previous prime is 230100320011. The next prime is 230100320027. The reversal of 230100320013 is 310023001032.
230100320013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 230100320013 - 21 = 230100320011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 230100319974 and 230100320001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230100320011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2652870 + ... + 2738232.
It is an arithmetic number, because the mean of its divisors is an integer number (19276813116).
Almost surely, 2230100320013 is an apocalyptic number.
It is an amenable number.
230100320013 is a deficient number, since it is larger than the sum of its proper divisors (78328689843).
230100320013 is a wasteful number, since it uses less digits than its factorization.
230100320013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90124.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 230100320013 its reverse (310023001032), we get a palindrome (540123321045).
The spelling of 230100320013 in words is "two hundred thirty billion, one hundred million, three hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •