Base | Representation |
---|---|
bin | 111101000000001111… |
… | …0001000001000000010 |
3 | 110112010220220001120122 |
4 | 1322000132020020002 |
5 | 4121244111301010 |
6 | 140103234540242 |
7 | 12315261012422 |
oct | 1720036101002 |
9 | 415126801518 |
10 | 131004400130 |
11 | 5061662888a |
12 | 21481137682 |
13 | c479cc2736 |
14 | 64aaa40482 |
15 | 361b113855 |
hex | 1e80788202 |
131004400130 has 16 divisors (see below), whose sum is σ = 236093071680. Its totient is φ = 52338393072.
The previous prime is 131004400129. The next prime is 131004400157. The reversal of 131004400130 is 31004400131.
131004400130 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1310044001302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131004400099 and 131004400108.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7912190 + ... + 7928729.
It is an arithmetic number, because the mean of its divisors is an integer number (14755816980).
Almost surely, 2131004400130 is an apocalyptic number.
131004400130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131004400130 is a deficient number, since it is larger than the sum of its proper divisors (105088671550).
131004400130 is a wasteful number, since it uses less digits than its factorization.
131004400130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15841753.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 131004400130 its reverse (31004400131), we get a palindrome (162008800261).
Subtracting from 131004400130 its reverse (31004400131), we obtain a palindrome (99999999999).
The spelling of 131004400130 in words is "one hundred thirty-one billion, four million, four hundred thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •