Base | Representation |
---|---|
bin | 10010110111101000… |
… | …00010101000101100 |
3 | 222010222221201222010 |
4 | 21123310002220230 |
5 | 131221324203112 |
6 | 4353115321220 |
7 | 506016105426 |
oct | 113364025054 |
9 | 28128851863 |
10 | 10130303532 |
11 | 4329323a88 |
12 | 1b68750210 |
13 | c559b115b |
14 | 6c15a1816 |
15 | 3e454b63c |
hex | 25bd02a2c |
10130303532 has 24 divisors (see below), whose sum is σ = 23640120000. Its totient is φ = 3376375696.
The previous prime is 10130303527. The next prime is 10130303537. The reversal of 10130303532 is 23530303101.
It is an interprime number because it is at equal distance from previous prime (10130303527) and next prime (10130303537).
It is a junction number, because it is equal to n+sod(n) for n = 10130303499 and 10130303508.
It is not an unprimeable number, because it can be changed into a prime (10130303537) 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, 70219 + ... + 158717.
It is an arithmetic number, because the mean of its divisors is an integer number (985005000).
Almost surely, 210130303532 is an apocalyptic number.
10130303532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10130303532 is an abundant number, since it is smaller than the sum of its proper divisors (13509816468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10130303532 is a wasteful number, since it uses less digits than its factorization.
10130303532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98045 (or 98043 counting only the distinct ones).
The product of its (nonzero) digits is 810, while the sum is 21.
Adding to 10130303532 its reverse (23530303101), we get a palindrome (33660606633).
The spelling of 10130303532 in words is "ten billion, one hundred thirty million, three hundred three thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •