Base | Representation |
---|---|
bin | 101111001011111001… |
… | …1001000000111010000 |
3 | 100200112221011122201101 |
4 | 1132113303020013100 |
5 | 3130011214310000 |
6 | 114314551114144 |
7 | 10215035242063 |
oct | 1362763100720 |
9 | 320487148641 |
10 | 101331010000 |
11 | 39a79793670 |
12 | 1777b672954 |
13 | 972b4b431c |
14 | 4c93b348da |
15 | 2981002e6a |
hex | 1797cc81d0 |
101331010000 has 100 divisors (see below), whose sum is σ = 267635754144. Its totient is φ = 36847600000.
The previous prime is 101331009979. The next prime is 101331010019. The reversal of 101331010000 is 10133101.
It is a tau number, because it is divible by the number of its divisors (100).
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 19 ways as a sum of consecutive naturals, for example, 350596 + ... + 570595.
Almost surely, 2101331010000 is an apocalyptic number.
101331010000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101331010000 is an abundant number, since it is smaller than the sum of its proper divisors (166304744144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101331010000 is an equidigital number, since it uses as much as digits as its factorization.
101331010000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 921230 (or 921209 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 10.
Adding to 101331010000 its reverse (10133101), we get a palindrome (101341143101).
101331010000 divided by its reverse (10133101) gives a 4-th power (10000 = 104).
It can be divided in two parts, 1013 and 31010000, that added together give a palindrome (31011013).
The spelling of 101331010000 in words is "one hundred one billion, three hundred thirty-one million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •