Base | Representation |
---|---|
bin | 1001001101101001101011… |
… | …0100011001101110100110 |
3 | 1022212102122012101001001100 |
4 | 2103122122310121232212 |
5 | 2311433001324441402 |
6 | 33313415001140530 |
7 | 2063610033632313 |
oct | 223323264315646 |
9 | 38772565331040 |
10 | 10130130312102 |
11 | 32561895185a9 |
12 | 117735418a746 |
13 | 5863620278b8 |
14 | 27042da39d0a |
15 | 12879444771c |
hex | 9369ad19ba6 |
10130130312102 has 24 divisors (see below), whose sum is σ = 21998161101384. Its totient is φ = 3369087730944.
The previous prime is 10130130312097. The next prime is 10130130312139. The reversal of 10130130312102 is 20121303103101.
10130130312102 is a `hidden beast` number, since 10 + 1 + 301 + 30 + 312 + 10 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 635189563 + ... + 635205510.
It is an arithmetic number, because the mean of its divisors is an integer number (916590045891).
Almost surely, 210130130312102 is an apocalyptic number.
10130130312102 is an abundant number, since it is smaller than the sum of its proper divisors (11868030789282).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10130130312102 is a wasteful number, since it uses less digits than its factorization.
10130130312102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1270395524 (or 1270395521 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 10130130312102 its reverse (20121303103101), we get a palindrome (30251433415203).
The spelling of 10130130312102 in words is "ten trillion, one hundred thirty billion, one hundred thirty million, three hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •