Base | Representation |
---|---|
bin | 111100100010111011… |
… | …0110010101110000111 |
3 | 110102121101110200100111 |
4 | 1321011312302232013 |
5 | 4112240334312221 |
6 | 135421505253451 |
7 | 12252020231623 |
oct | 1710566625607 |
9 | 412541420314 |
10 | 130021010311 |
11 | 5016151a525 |
12 | 21247934287 |
13 | c35134ca7a |
14 | 64161b8183 |
15 | 35aeb13be1 |
hex | 1e45db2b87 |
130021010311 has 8 divisors (see below), whose sum is σ = 136870572800. Its totient is φ = 123172083000.
The previous prime is 130021010299. The next prime is 130021010323. The reversal of 130021010311 is 113010120031.
It is an interprime number because it is at equal distance from previous prime (130021010299) and next prime (130021010323).
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 130021010311 - 25 = 130021010279 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130021010291 and 130021010300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130021010011) 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, 294610 + ... + 588928.
It is an arithmetic number, because the mean of its divisors is an integer number (17108821600).
Almost surely, 2130021010311 is an apocalyptic number.
130021010311 is a deficient number, since it is larger than the sum of its proper divisors (6849562489).
130021010311 is a wasteful number, since it uses less digits than its factorization.
130021010311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317589.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 130021010311 its reverse (113010120031), we get a palindrome (243031130342).
The spelling of 130021010311 in words is "one hundred thirty billion, twenty-one million, ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •