Base | Representation |
---|---|
bin | 11101110010010011010010… |
… | …010000001111010100010000 |
3 | 122011211110222022212220001210 |
4 | 131302103102100033110100 |
5 | 114132301030140003100 |
6 | 1142340325531300120 |
7 | 36410303602360311 |
oct | 3562232220172420 |
9 | 564743868786053 |
10 | 131000030000400 |
11 | 38816889853940 |
12 | 12838824baa640 |
13 | 5813332b25c32 |
14 | 244c6145b4608 |
15 | 1022928788c50 |
hex | 7724d240f510 |
131000030000400 has 240 divisors, whose sum is σ = 462505002660288. Its totient is φ = 31430184960000.
The previous prime is 131000030000383. The next prime is 131000030000459. The reversal of 131000030000400 is 4000030000131.
It is a tau number, because it is divible by the number of its divisors (240).
It is a super-2 number, since 2×1310000300004002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 49875501 + ... + 52436300.
Almost surely, 2131000030000400 is an apocalyptic number.
131000030000400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131000030000400 is an abundant number, since it is smaller than the sum of its proper divisors (331504972659888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131000030000400 is a wasteful number, since it uses less digits than its factorization.
131000030000400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102311930 (or 102311919 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 131000030000400 its reverse (4000030000131), we get a palindrome (135000060000531).
The spelling of 131000030000400 in words is "one hundred thirty-one trillion, thirty million, four hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •