Base | Representation |
---|---|
bin | 1010111010100011111101… |
… | …0010000001001100101010 |
3 | 1120111022012021200022212022 |
4 | 2232220333102001030222 |
5 | 3033111424240010010 |
6 | 41305135244544442 |
7 | 2346025634343500 |
oct | 256507722011452 |
9 | 46438167608768 |
10 | 12001200313130 |
11 | 3907753784926 |
12 | 1419ab5852122 |
13 | 690929293742 |
14 | 2d6c0b190670 |
15 | 15c2a34bdd55 |
hex | aea3f48132a |
12001200313130 has 96 divisors (see below), whose sum is σ = 25373591496000. Its totient is φ = 4074683811072.
The previous prime is 12001200313087. The next prime is 12001200313159. The reversal of 12001200313130 is 3131300210021.
It is a super-2 number, since 2×120012003131302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12001200313099 and 12001200313108.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 141466166 + ... + 141550974.
It is an arithmetic number, because the mean of its divisors is an integer number (264308244750).
Almost surely, 212001200313130 is an apocalyptic number.
12001200313130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12001200313130 is an abundant number, since it is smaller than the sum of its proper divisors (13372391182870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12001200313130 is a wasteful number, since it uses less digits than its factorization.
12001200313130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87636 (or 87629 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 12001200313130 its reverse (3131300210021), we get a palindrome (15132500523151).
The spelling of 12001200313130 in words is "twelve trillion, one billion, two hundred million, three hundred thirteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •