Base | Representation |
---|---|
bin | 111100100101010110… |
… | …0111110100000000001 |
3 | 110102211001110210200000 |
4 | 1321022230332200001 |
5 | 4112422143320301 |
6 | 135433532150213 |
7 | 12254025333504 |
oct | 1711254764001 |
9 | 412731423600 |
10 | 130102323201 |
11 | 501a3408064 |
12 | 2126b008369 |
13 | c36514c8c6 |
14 | 6422d0313b |
15 | 35b6d26786 |
hex | 1e4ab3e801 |
130102323201 has 24 divisors (see below), whose sum is σ = 194951352960. Its totient is φ = 86705700912.
The previous prime is 130102323157. The next prime is 130102323223. The reversal of 130102323201 is 102323201031.
130102323201 is a `hidden beast` number, since 130 + 10 + 2 + 323 + 201 = 666.
It is not a de Polignac number, because 130102323201 - 27 = 130102323073 is a prime.
It is a super-2 number, since 2×1301023232012 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (130102323101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 646035 + ... + 823143.
It is an arithmetic number, because the mean of its divisors is an integer number (8122973040).
Almost surely, 2130102323201 is an apocalyptic number.
It is an amenable number.
130102323201 is a deficient number, since it is larger than the sum of its proper divisors (64849029759).
130102323201 is an equidigital number, since it uses as much as digits as its factorization.
130102323201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180147 (or 180135 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 130102323201 its reverse (102323201031), we get a palindrome (232425524232).
The spelling of 130102323201 in words is "one hundred thirty billion, one hundred two million, three hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •