Base | Representation |
---|---|
bin | 1011001100000001001011… |
… | …1000110110110001010000 |
3 | 1121112222022000221000122010 |
4 | 2303000102320312301100 |
5 | 3103020124411330112 |
6 | 42055014313142520 |
7 | 2406503543153061 |
oct | 263002270666120 |
9 | 47488260830563 |
10 | 12301103230032 |
11 | 3a129610a2161 |
12 | 14680526baa40 |
13 | 6b2cb1c60416 |
14 | 30753b460568 |
15 | 164ea73a263c |
hex | b3012e36c50 |
12301103230032 has 20 divisors (see below), whose sum is σ = 31777850011040. Its totient is φ = 4100367743328.
The previous prime is 12301103230019. The next prime is 12301103230043. The reversal of 12301103230032 is 23003230110321.
It is a junction number, because it is equal to n+sod(n) for n = 12301103229990 and 12301103230008.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 128136491932 + ... + 128136492027.
It is an arithmetic number, because the mean of its divisors is an integer number (1588892500552).
Almost surely, 212301103230032 is an apocalyptic number.
12301103230032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12301103230032 is an abundant number, since it is smaller than the sum of its proper divisors (19476746781008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12301103230032 is a wasteful number, since it uses less digits than its factorization.
12301103230032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 256272983970 (or 256272983964 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 12301103230032 its reverse (23003230110321), we get a palindrome (35304333340353).
The spelling of 12301103230032 in words is "twelve trillion, three hundred one billion, one hundred three million, two hundred thirty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •