Base | Representation |
---|---|
bin | 11101110111000111100111… |
… | …101000110000010010010110 |
3 | 122020000010112020210221020220 |
4 | 131313013213220300102112 |
5 | 114203212043403331410 |
6 | 1143152401444535210 |
7 | 36443234055400566 |
oct | 3567074750602226 |
9 | 566003466727226 |
10 | 131331101230230 |
11 | 38934230938a80 |
12 | 12890a200b1506 |
13 | 5838614c36325 |
14 | 2460660130da6 |
15 | 102b353b23070 |
hex | 7771e7a30496 |
131331101230230 has 32 divisors (see below), whose sum is σ = 343848701403648. Its totient is φ = 31837842722400.
The previous prime is 131331101230177. The next prime is 131331101230297. The reversal of 131331101230230 is 32032101133131.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 131331101230230.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 198986516686 + ... + 198986517345.
It is an arithmetic number, because the mean of its divisors is an integer number (10745271918864).
Almost surely, 2131331101230230 is an apocalyptic number.
131331101230230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131331101230230 is an abundant number, since it is smaller than the sum of its proper divisors (212517600173418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131331101230230 is a wasteful number, since it uses less digits than its factorization.
131331101230230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397973034052.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 131331101230230 its reverse (32032101133131), we get a palindrome (163363202363361).
The spelling of 131331101230230 in words is "one hundred thirty-one trillion, three hundred thirty-one billion, one hundred one million, two hundred thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •