Base | Representation |
---|---|
bin | 1001010011011110000110… |
… | …1010000001001011000110 |
3 | 1100012222200110122210212222 |
4 | 2110313201222001023012 |
5 | 2320102222333121410 |
6 | 33431351111212342 |
7 | 2104046326631552 |
oct | 224674152011306 |
9 | 40188613583788 |
10 | 10230103020230 |
11 | 3294620502935 |
12 | 11927b49770b2 |
13 | 592904c9cbb2 |
14 | 2751d51d4862 |
15 | 12b196090955 |
hex | 94de1a812c6 |
10230103020230 has 32 divisors (see below), whose sum is σ = 18663842957760. Its totient is φ = 4036833054720.
The previous prime is 10230103020217. The next prime is 10230103020233. The reversal of 10230103020230 is 3202030103201.
It is a junction number, because it is equal to n+sod(n) for n = 10230103020199 and 10230103020208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10230103020233) 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, 16654115 + ... + 17257454.
It is an arithmetic number, because the mean of its divisors is an integer number (583245092430).
Almost surely, 210230103020230 is an apocalyptic number.
10230103020230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10230103020230 is a deficient number, since it is larger than the sum of its proper divisors (8433739937530).
10230103020230 is a wasteful number, since it uses less digits than its factorization.
10230103020230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33911984.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 10230103020230 its reverse (3202030103201), we get a palindrome (13432133123431).
The spelling of 10230103020230 in words is "ten trillion, two hundred thirty billion, one hundred three million, twenty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •