Base | Representation |
---|---|
bin | 11101110010010011010010… |
… | …010000001111010100010001 |
3 | 122011211110222022212220001211 |
4 | 131302103102100033110101 |
5 | 114132301030140003101 |
6 | 1142340325531300121 |
7 | 36410303602360312 |
oct | 3562232220172421 |
9 | 564743868786054 |
10 | 131000030000401 |
11 | 38816889853941 |
12 | 12838824baa641 |
13 | 5813332b25c33 |
14 | 244c6145b4609 |
15 | 1022928788c51 |
hex | 7724d240f511 |
131000030000401 has 8 divisors (see below), whose sum is σ = 131732294353920. Its totient is φ = 130267770320688.
The previous prime is 131000030000383. The next prime is 131000030000459. The reversal of 131000030000401 is 104000030000131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131000030000401 - 25 = 131000030000369 is a prime.
It is a super-2 number, since 2×1310000300004012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131000030000491) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65714595 + ... + 67678711.
It is an arithmetic number, because the mean of its divisors is an integer number (16466536794240).
Almost surely, 2131000030000401 is an apocalyptic number.
It is an amenable number.
131000030000401 is a deficient number, since it is larger than the sum of its proper divisors (732264353519).
131000030000401 is a wasteful number, since it uses less digits than its factorization.
131000030000401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2336903.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 131000030000401 its reverse (104000030000131), we get a palindrome (235000060000532).
The spelling of 131000030000401 in words is "one hundred thirty-one trillion, thirty million, four hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •