Base | Representation |
---|---|
bin | 11101110010010011010111… |
… | …000101010011100100010110 |
3 | 122011211111011222100010111012 |
4 | 131302103113011103210112 |
5 | 114132301211410122220 |
6 | 1142340341544012222 |
7 | 36410305605132050 |
oct | 3562232705234426 |
9 | 564744158303435 |
10 | 131000111020310 |
11 | 38816920561344 |
12 | 12838848161072 |
13 | 58133468525cc |
14 | 244c6212648d0 |
15 | 102293093eac5 |
hex | 7724d7153916 |
131000111020310 has 64 divisors (see below), whose sum is σ = 269662047063552. Its totient is φ = 44884977382656.
The previous prime is 131000111020307. The next prime is 131000111020319. The reversal of 131000111020310 is 13020111000131.
It is a happy number.
It is a super-2 number, since 2×1310001110203102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131000111020319) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1765391669 + ... + 1765465871.
It is an arithmetic number, because the mean of its divisors is an integer number (4213469485368).
Almost surely, 2131000111020310 is an apocalyptic number.
131000111020310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131000111020310 is an abundant number, since it is smaller than the sum of its proper divisors (138661936043242).
131000111020310 is a wasteful number, since it uses less digits than its factorization.
131000111020310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90357.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 131000111020310 its reverse (13020111000131), we get a palindrome (144020222020441).
The spelling of 131000111020310 in words is "one hundred thirty-one trillion, one hundred eleven million, twenty thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •