Base | Representation |
---|---|
bin | 111101001010000010… |
… | …0011100011101100001 |
3 | 110112222211121102200002 |
4 | 1322110010130131201 |
5 | 4122432300241001 |
6 | 140200022305345 |
7 | 12326362611545 |
oct | 1722404343541 |
9 | 415884542602 |
10 | 131333212001 |
11 | 507751a1032 |
12 | 21553288255 |
13 | c50016a784 |
14 | 64dc593a25 |
15 | 3639e1446b |
hex | 1e9411c761 |
131333212001 has 8 divisors (see below), whose sum is σ = 132177276000. Its totient is φ = 130489615872.
The previous prime is 131333211929. The next prime is 131333212007. The reversal of 131333212001 is 100212333131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131333212001 is a prime.
It is a super-2 number, since 2×1313332120012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131333212007) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 455201 + ... + 685473.
It is an arithmetic number, because the mean of its divisors is an integer number (16522159500).
Almost surely, 2131333212001 is an apocalyptic number.
It is an amenable number.
131333212001 is a deficient number, since it is larger than the sum of its proper divisors (844063999).
131333212001 is a wasteful number, since it uses less digits than its factorization.
131333212001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233935.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 131333212001 its reverse (100212333131), we get a palindrome (231545545132).
The spelling of 131333212001 in words is "one hundred thirty-one billion, three hundred thirty-three million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •