Base | Representation |
---|---|
bin | 10111000010011100101101… |
… | …001010111001000110110000 |
3 | 111021202102020011122022222110 |
4 | 113002130231022321012300 |
5 | 101240040140303410000 |
6 | 555255143521205320 |
7 | 30225240414525612 |
oct | 2702345512710660 |
9 | 437672204568873 |
10 | 101323331310000 |
11 | 2a314a90037948 |
12 | b445182790840 |
13 | 446c997b40657 |
14 | 1b0410ac8cdb2 |
15 | baa9bbb4a850 |
hex | 5c272d2b91b0 |
101323331310000 has 100 divisors (see below), whose sum is σ = 327085223343032. Its totient is φ = 27019555008000.
The previous prime is 101323331309947. The next prime is 101323331310011. The reversal of 101323331310000 is 13133323101.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×1013233313100002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1688692189 + ... + 1688752188.
Almost surely, 2101323331310000 is an apocalyptic number.
101323331310000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101323331310000 is an abundant number, since it is smaller than the sum of its proper divisors (225761892033032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101323331310000 is an equidigital number, since it uses as much as digits as its factorization.
101323331310000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3377444408 (or 3377444387 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 101323331310000 its reverse (13133323101), we get a palindrome (101336464633101).
The spelling of 101323331310000 in words is "one hundred one trillion, three hundred twenty-three billion, three hundred thirty-one million, three hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •