Base | Representation |
---|---|
bin | 10011000011110010… |
… | …01000001001100010 |
3 | 222102002212200222220 |
4 | 21201321020021202 |
5 | 131423432101010 |
6 | 4411201411510 |
7 | 511365054543 |
oct | 114171101142 |
9 | 28362780886 |
10 | 10232300130 |
11 | 4380959598 |
12 | 1b96939b96 |
13 | c70b73680 |
14 | 6d0d524ca |
15 | 3ed497970 |
hex | 261e48262 |
10232300130 has 64 divisors (see below), whose sum is σ = 26636964480. Its totient is φ = 2500586496.
The previous prime is 10232300129. The next prime is 10232300131. The reversal of 10232300130 is 3100323201.
It is an interprime number because it is at equal distance from previous prime (10232300129) and next prime (10232300131).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (10232300131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40167 + ... + 148586.
It is an arithmetic number, because the mean of its divisors is an integer number (416202570).
Almost surely, 210232300130 is an apocalyptic number.
10232300130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10232300130 is an abundant number, since it is smaller than the sum of its proper divisors (16404664350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10232300130 is a wasteful number, since it uses less digits than its factorization.
10232300130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188915.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 10232300130 its reverse (3100323201), we get a palindrome (13332623331).
The spelling of 10232300130 in words is "ten billion, two hundred thirty-two million, three hundred thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •