Base | Representation |
---|---|
bin | 1010111010100110111110… |
… | …1110010000110000000001 |
3 | 1120111101021220221021112111 |
4 | 2232221233232100300001 |
5 | 3033120110313220413 |
6 | 41305352040055321 |
7 | 2346055033304632 |
oct | 256515756206001 |
9 | 46441256837474 |
10 | 12002013023233 |
11 | 3908030506a72 |
12 | 141a0a1a64541 |
13 | 690a287768ac |
14 | 2d6c870a7889 |
15 | 15c2eea06d3d |
hex | aea6fb90c01 |
12002013023233 has 8 divisors (see below), whose sum is σ = 12015023119400. Its totient is φ = 11989005384960.
The previous prime is 12002013023227. The next prime is 12002013023243. The reversal of 12002013023233 is 33232031020021.
It can be written as a sum of positive squares in 4 ways, for example, as 248305879809 + 11753707143424 = 498303^2 + 3428368^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12002013023233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12002013023243) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9242491 + ... + 10460767.
It is an arithmetic number, because the mean of its divisors is an integer number (1501877889925).
Almost surely, 212002013023233 is an apocalyptic number.
It is an amenable number.
12002013023233 is a deficient number, since it is larger than the sum of its proper divisors (13010096167).
12002013023233 is a wasteful number, since it uses less digits than its factorization.
12002013023233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1228947.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 12002013023233 its reverse (33232031020021), we get a palindrome (45234044043254).
The spelling of 12002013023233 in words is "twelve trillion, two billion, thirteen million, twenty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •