Base | Representation |
---|---|
bin | 11101101000000111100001… |
… | …010010010011110100100111 |
3 | 122002100120121011001000101010 |
4 | 131220013201102103310213 |
5 | 114034314303322012020 |
6 | 1141043030420033303 |
7 | 36305610326135616 |
oct | 3550074122236447 |
9 | 562316534030333 |
10 | 130300202532135 |
11 | 38577007456959 |
12 | 12745076232833 |
13 | 579234434679c |
14 | 24267c618187d |
15 | 100e619911de0 |
hex | 7681e1493d27 |
130300202532135 has 16 divisors (see below), whose sum is σ = 208898120304000. Its totient is φ = 69354175932960.
The previous prime is 130300202532091. The next prime is 130300202532209. The reversal of 130300202532135 is 531235202003031.
It is a happy number.
It is not a de Polignac number, because 130300202532135 - 28 = 130300202531879 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8704080861 + ... + 8704095830.
It is an arithmetic number, because the mean of its divisors is an integer number (13056132519000).
Almost surely, 2130300202532135 is an apocalyptic number.
130300202532135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
130300202532135 is a deficient number, since it is larger than the sum of its proper divisors (78597917771865).
130300202532135 is a wasteful number, since it uses less digits than its factorization.
130300202532135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17408177198.
The product of its (nonzero) digits is 16200, while the sum is 30.
Adding to 130300202532135 its reverse (531235202003031), we get a palindrome (661535404535166).
The spelling of 130300202532135 in words is "one hundred thirty trillion, three hundred billion, two hundred two million, five hundred thirty-two thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •