Base | Representation |
---|---|
bin | 11101101000001000010110… |
… | …110110001001111011010001 |
3 | 122002100122220202220001212211 |
4 | 131220020112312021323101 |
5 | 114034323123341334413 |
6 | 1141043255515552121 |
7 | 36305641520050120 |
oct | 3550102666117321 |
9 | 562318822801784 |
10 | 130301101121233 |
11 | 38577428705179 |
12 | 1274528715b641 |
13 | 5792458567c03 |
14 | 242686d651ab7 |
15 | 100e66d76083d |
hex | 768216d89ed1 |
130301101121233 has 16 divisors (see below), whose sum is σ = 149496344642304. Its totient is φ = 111251065651200.
The previous prime is 130301101121231. The next prime is 130301101121251. The reversal of 130301101121233 is 332121101103031.
It is a cyclic number.
It is not a de Polignac number, because 130301101121233 - 21 = 130301101121231 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130301101121231) by changing a digit.
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, 249741033 + ... + 250262233.
It is an arithmetic number, because the mean of its divisors is an integer number (9343521540144).
Almost surely, 2130301101121233 is an apocalyptic number.
It is an amenable number.
130301101121233 is a deficient number, since it is larger than the sum of its proper divisors (19195243521071).
130301101121233 is a wasteful number, since it uses less digits than its factorization.
130301101121233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 660432.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 130301101121233 its reverse (332121101103031), we get a palindrome (462422202224264).
The spelling of 130301101121233 in words is "one hundred thirty trillion, three hundred one billion, one hundred one million, one hundred twenty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •