Base | Representation |
---|---|
bin | 1011001000001001110001… |
… | …0010010110000000111100 |
3 | 1121022121212111200011201202 |
4 | 2302002130102112000330 |
5 | 3100423120330212333 |
6 | 42004312151555032 |
7 | 2401632665610020 |
oct | 262023422260074 |
9 | 47277774604652 |
10 | 12234688913468 |
11 | 399777aa3012a |
12 | 14571b868ba78 |
13 | 6a9959652658 |
14 | 30423ab4c380 |
15 | 1633bb9765e8 |
hex | b209c49603c |
12234688913468 has 24 divisors (see below), whose sum is σ = 24471108759552. Its totient is φ = 5243067191664.
The previous prime is 12234688913441. The next prime is 12234688913501. The reversal of 12234688913468 is 86431988643221.
It is a super-2 number, since 2×122346889134682 (a number of 27 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (65) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15051680 + ... + 15843687.
It is an arithmetic number, because the mean of its divisors is an integer number (1019629531648).
Almost surely, 212234688913468 is an apocalyptic number.
It is an amenable number.
12234688913468 is an abundant number, since it is smaller than the sum of its proper divisors (12236419846084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12234688913468 is a wasteful number, since it uses less digits than its factorization.
12234688913468 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30909521 (or 30909519 counting only the distinct ones).
The product of its digits is 95551488, while the sum is 65.
The spelling of 12234688913468 in words is "twelve trillion, two hundred thirty-four billion, six hundred eighty-eight million, nine hundred thirteen thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •