Base | Representation |
---|---|
bin | 111101000001000101… |
… | …1001110110001000110 |
3 | 110112012220201010122020 |
4 | 1322002023032301012 |
5 | 4121323422013110 |
6 | 140110135544010 |
7 | 12316056063111 |
oct | 1720213166106 |
9 | 415186633566 |
10 | 131033001030 |
11 | 50630793098 |
12 | 2148a82b006 |
13 | c482bc7949 |
14 | 64b0767578 |
15 | 361d8b2d70 |
hex | 1e822cec46 |
131033001030 has 64 divisors (see below), whose sum is σ = 334445137920. Its totient is φ = 32741809664.
The previous prime is 131033000981. The next prime is 131033001067. The reversal of 131033001030 is 30100330131.
131033001030 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 450150 + ... + 681689.
It is an arithmetic number, because the mean of its divisors is an integer number (5225705280).
Almost surely, 2131033001030 is an apocalyptic number.
131033001030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131033001030 is an abundant number, since it is smaller than the sum of its proper divisors (203412136890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131033001030 is a wasteful number, since it uses less digits than its factorization.
131033001030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1132093.
The product of its (nonzero) digits is 81, while the sum is 15.
Adding to 131033001030 its reverse (30100330131), we get a palindrome (161133331161).
The spelling of 131033001030 in words is "one hundred thirty-one billion, thirty-three million, one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •