Base | Representation |
---|---|
bin | 11101110010011100111101… |
… | …000101001110100011100000 |
3 | 122011212110202212211210202002 |
4 | 131302130331011032203200 |
5 | 114132433311011213100 |
6 | 1142345204050143132 |
7 | 36411122100611162 |
oct | 3562347505164340 |
9 | 564773685753662 |
10 | 131010412210400 |
11 | 38820227292988 |
12 | 1283a841b81aa8 |
13 | 58142c8a66468 |
14 | 244cd1b3ca932 |
15 | 1022d34e942d5 |
hex | 77273d14e8e0 |
131010412210400 has 36 divisors (see below), whose sum is σ = 319829168810592. Its totient is φ = 52404164883840.
The previous prime is 131010412210369. The next prime is 131010412210429. The reversal of 131010412210400 is 4012214010131.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 81881506832 + ... + 81881508431.
It is an arithmetic number, because the mean of its divisors is an integer number (8884143578072).
Almost surely, 2131010412210400 is an apocalyptic number.
131010412210400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131010412210400 is an abundant number, since it is smaller than the sum of its proper divisors (188818756600192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131010412210400 is a wasteful number, since it uses less digits than its factorization.
131010412210400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163763015283 (or 163763015270 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 131010412210400 its reverse (4012214010131), we get a palindrome (135022626220531).
The spelling of 131010412210400 in words is "one hundred thirty-one trillion, ten billion, four hundred twelve million, two hundred ten thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •