Base | Representation |
---|---|
bin | 1011010011010100010100… |
… | …1001000110110010001100 |
3 | 1121222221222011211101122100 |
4 | 2310311011021012302030 |
5 | 3112043433100333231 |
6 | 42232353325515100 |
7 | 2421533156426460 |
oct | 264650511066214 |
9 | 47887864741570 |
10 | 12426500402316 |
11 | 3a6105a578740 |
12 | 1488409a12a90 |
13 | 6c1a77367850 |
14 | 30d6354d44a0 |
15 | 1683960b51e6 |
hex | b4d45246c8c |
12426500402316 has 288 divisors, whose sum is σ = 44394517440000. Its totient is φ = 2822571048960.
The previous prime is 12426500402299. The next prime is 12426500402369. The reversal of 12426500402316 is 61320400562421.
12426500402316 is a `hidden beast` number, since 1 + 242 + 6 + 5 + 0 + 0 + 402 + 3 + 1 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 8389941 + ... + 9759308.
It is an arithmetic number, because the mean of its divisors is an integer number (154147630000).
Almost surely, 212426500402316 is an apocalyptic number.
It is an amenable number.
12426500402316 is an abundant number, since it is smaller than the sum of its proper divisors (31968017037684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12426500402316 is a wasteful number, since it uses less digits than its factorization.
12426500402316 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18149309 (or 18149304 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
Adding to 12426500402316 its reverse (61320400562421), we get a palindrome (73746900964737).
The spelling of 12426500402316 in words is "twelve trillion, four hundred twenty-six billion, five hundred million, four hundred two thousand, three hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •