Base | Representation |
---|---|
bin | 10111000010100100001000… |
… | …001001000010100101010010 |
3 | 111021210011210112010211120000 |
4 | 113002210020021002211102 |
5 | 101240203000300032010 |
6 | 555302542342030430 |
7 | 30225642035352312 |
oct | 2702441011024522 |
9 | 437704715124500 |
10 | 101331300002130 |
11 | 2a3183aa171220 |
12 | b446827418416 |
13 | 4470667a413b3 |
14 | 1b04665327442 |
15 | baacd650e7c0 |
hex | 5c2908242952 |
101331300002130 has 80 divisors (see below), whose sum is σ = 297238480032384. Its totient is φ = 24565163634720.
The previous prime is 101331300002087. The next prime is 101331300002161. The reversal of 101331300002130 is 31200003133101.
It is a happy number.
101331300002130 is a `hidden beast` number, since 1 + 0 + 1 + 331 + 300 + 0 + 0 + 2 + 1 + 30 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 5686371562 + ... + 5686389381.
Almost surely, 2101331300002130 is an apocalyptic number.
101331300002130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101331300002130 is an abundant number, since it is smaller than the sum of its proper divisors (195907180030254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101331300002130 is a wasteful number, since it uses less digits than its factorization.
101331300002130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11372760973 (or 11372760964 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 101331300002130 its reverse (31200003133101), we get a palindrome (132531303135231).
The spelling of 101331300002130 in words is "one hundred one trillion, three hundred thirty-one billion, three hundred million, two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •