Base | Representation |
---|---|
bin | 111101000000001000… |
… | …1111101110011000100 |
3 | 110112010200220002102110 |
4 | 1322000101331303010 |
5 | 4121242302241400 |
6 | 140103042341020 |
7 | 12315221634033 |
oct | 1720021756304 |
9 | 415120802373 |
10 | 131001212100 |
11 | 50614850650 |
12 | 2148005a770 |
13 | c479447625 |
14 | 64aa45071a |
15 | 361abd3e50 |
hex | 1e8047dcc4 |
131001212100 has 144 divisors (see below), whose sum is σ = 424663194816. Its totient is φ = 30899520000.
The previous prime is 131001212087. The next prime is 131001212123. The reversal of 131001212100 is 1212100131.
It is a super-2 number, since 2×1310012121002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 414351 + ... + 658550.
It is an arithmetic number, because the mean of its divisors is an integer number (2949049964).
Almost surely, 2131001212100 is an apocalyptic number.
131001212100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131001212100 is an abundant number, since it is smaller than the sum of its proper divisors (293661982716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131001212100 is a wasteful number, since it uses less digits than its factorization.
131001212100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1072966 (or 1072959 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 131001212100 its reverse (1212100131), we get a palindrome (132213312231).
The spelling of 131001212100 in words is "one hundred thirty-one billion, one million, two hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •