Base | Representation |
---|---|
bin | 10010110111100110… |
… | …10000111100101100 |
3 | 222010222120101210100 |
4 | 21123303100330230 |
5 | 131221301200022 |
6 | 4353111111100 |
7 | 506014300164 |
oct | 113363207454 |
9 | 28128511710 |
10 | 10130100012 |
11 | 43291a508a |
12 | 1b68672490 |
13 | c5593c626 |
14 | 6c154b5a4 |
15 | 3e450b1ac |
hex | 25bcd0f2c |
10130100012 has 36 divisors (see below), whose sum is σ = 27112916376. Its totient is φ = 3178070400.
The previous prime is 10130099999. The next prime is 10130100017. The reversal of 10130100012 is 21000103101.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10130099967 and 10130100003.
It is not an unprimeable number, because it can be changed into a prime (10130100017) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8275614 + ... + 8276837.
It is an arithmetic number, because the mean of its divisors is an integer number (753136566).
Almost surely, 210130100012 is an apocalyptic number.
10130100012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10130100012 is an abundant number, since it is smaller than the sum of its proper divisors (16982816364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10130100012 is a wasteful number, since it uses less digits than its factorization.
10130100012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16552478 (or 16552473 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 10130100012 its reverse (21000103101), we get a palindrome (31130203113).
The spelling of 10130100012 in words is "ten billion, one hundred thirty million, one hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •