Base | Representation |
---|---|
bin | 111101000000001110… |
… | …1110111110001001010 |
3 | 110112010220202122200011 |
4 | 1322000131313301022 |
5 | 4121244102130010 |
6 | 140103233302134 |
7 | 12315260313166 |
oct | 1720035676112 |
9 | 415126678604 |
10 | 131004333130 |
11 | 50616592510 |
12 | 2148110494a |
13 | c479c9b0a8 |
14 | 64aaa23ca6 |
15 | 361b0eda8a |
hex | 1e80777c4a |
131004333130 has 32 divisors (see below), whose sum is σ = 265543100928. Its totient is φ = 46101230400.
The previous prime is 131004333127. The next prime is 131004333217. The reversal of 131004333130 is 31333400131.
131004333130 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19205437 + ... + 19212256.
It is an arithmetic number, because the mean of its divisors is an integer number (8298221904).
Almost surely, 2131004333130 is an apocalyptic number.
131004333130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131004333130 is an abundant number, since it is smaller than the sum of its proper divisors (134538767798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131004333130 is a wasteful number, since it uses less digits than its factorization.
131004333130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38417742.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 131004333130 its reverse (31333400131), we get a palindrome (162337733261).
The spelling of 131004333130 in words is "one hundred thirty-one billion, four million, three hundred thirty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •