Base | Representation |
---|---|
bin | 1001001011111101100001… |
… | …1110100101111100101110 |
3 | 1022202122201000201221220201 |
4 | 2102333120132211330232 |
5 | 2310444023100330220 |
6 | 33252214205104114 |
7 | 2061531450304000 |
oct | 222773036457456 |
9 | 38678630657821 |
10 | 10101100011310 |
11 | 3244941691980 |
12 | 11717b1b5803a |
13 | 5836b6820b19 |
14 | 26cc782d2370 |
15 | 127b45a16d0a |
hex | 92fd87a5f2e |
10101100011310 has 64 divisors (see below), whose sum is σ = 23131063987200. Its totient is φ = 3148394796960.
The previous prime is 10101100011227. The next prime is 10101100011337. The reversal of 10101100011310 is 1311000110101.
It is a super-2 number, since 2×101011000113102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 133822594 + ... + 133898053.
It is an arithmetic number, because the mean of its divisors is an integer number (361422874800).
Almost surely, 210101100011310 is an apocalyptic number.
10101100011310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10101100011310 is an abundant number, since it is smaller than the sum of its proper divisors (13029963975890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101100011310 is a wasteful number, since it uses less digits than its factorization.
10101100011310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 267720686 (or 267720672 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 10101100011310 its reverse (1311000110101), we get a palindrome (11412100121411).
The spelling of 10101100011310 in words is "ten trillion, one hundred one billion, one hundred million, eleven thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •