Base | Representation |
---|---|
bin | 11101110010110000001010… |
… | …000011101011010011011010 |
3 | 122011221102222211201221221110 |
4 | 131302300022003223103122 |
5 | 114133303022414033310 |
6 | 1142402454042321150 |
7 | 36412452045502164 |
oct | 3562601203532332 |
9 | 564842884657843 |
10 | 131031031002330 |
11 | 38828a48035498 |
12 | 128428371b91b6 |
13 | 58162336b9264 |
14 | 244dd1594b934 |
15 | 10236401e0d20 |
hex | 772c0a0eb4da |
131031031002330 has 64 divisors (see below), whose sum is σ = 318271259432448. Its totient is φ = 34519764260160.
The previous prime is 131031031002329. The next prime is 131031031002353. The reversal of 131031031002330 is 33200130130131.
It is a junction number, because it is equal to n+sod(n) for n = 131031031002297 and 131031031002306.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 102478017 + ... + 103748763.
It is an arithmetic number, because the mean of its divisors is an integer number (4972988428632).
Almost surely, 2131031031002330 is an apocalyptic number.
131031031002330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131031031002330 is an abundant number, since it is smaller than the sum of its proper divisors (187240228430118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131031031002330 is a wasteful number, since it uses less digits than its factorization.
131031031002330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1312251.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 131031031002330 its reverse (33200130130131), we get a palindrome (164231161132461).
The spelling of 131031031002330 in words is "one hundred thirty-one trillion, thirty-one billion, thirty-one million, two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •