Base | Representation |
---|---|
bin | 1010111011001000111101… |
… | …0001100010101111000110 |
3 | 1120112020211110110112211101 |
4 | 2232302033101202233012 |
5 | 3033242244332101410 |
6 | 41313501001530314 |
7 | 2346530025006220 |
oct | 256621721425706 |
9 | 46466743415741 |
10 | 12011132300230 |
11 | 3910990065828 |
12 | 141ba07aa399a |
13 | 69184cb5999b |
14 | 2d74b028b410 |
15 | 15c6853e4d3a |
hex | aec8f462bc6 |
12011132300230 has 128 divisors (see below), whose sum is σ = 26049110630400. Its totient is φ = 3900755529216.
The previous prime is 12011132300221. The next prime is 12011132300263. The reversal of 12011132300230 is 3200323111021.
It is a junction number, because it is equal to n+sod(n) for n = 12011132300198 and 12011132300207.
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 63 ways as a sum of consecutive naturals, for example, 24939567 + ... + 25416613.
It is an arithmetic number, because the mean of its divisors is an integer number (203508676800).
Almost surely, 212011132300230 is an apocalyptic number.
12011132300230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12011132300230 is an abundant number, since it is smaller than the sum of its proper divisors (14037978330170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12011132300230 is a wasteful number, since it uses less digits than its factorization.
12011132300230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 477326.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 12011132300230 its reverse (3200323111021), we get a palindrome (15211455411251).
The spelling of 12011132300230 in words is "twelve trillion, eleven billion, one hundred thirty-two million, three hundred thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •