Base | Representation |
---|---|
bin | 1010111011001111111010… |
… | …0111011001110111000111 |
3 | 1120112102122122102212112222 |
4 | 2232303332213121313013 |
5 | 3033310111034131043 |
6 | 41314410211402555 |
7 | 2346624226525460 |
oct | 256637647316707 |
9 | 46472578385488 |
10 | 12013000302023 |
11 | 3911759546166 |
12 | 14202495b345b |
13 | 691a89b68ba6 |
14 | 2d760a3c5d67 |
15 | 15c7443d1d68 |
hex | aecfe9d9dc7 |
12013000302023 has 8 divisors (see below), whose sum is σ = 13729165406880. Its totient is φ = 10296840748320.
The previous prime is 12013000301977. The next prime is 12013000302053. The reversal of 12013000302023 is 32020300031021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12013000302023 - 234 = 11995820432839 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12013000301992 and 12013000302010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12013000302053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5585273 + ... + 7431101.
It is an arithmetic number, because the mean of its divisors is an integer number (1716145675860).
Almost surely, 212013000302023 is an apocalyptic number.
12013000302023 is a deficient number, since it is larger than the sum of its proper divisors (1716165104857).
12013000302023 is an equidigital number, since it uses as much as digits as its factorization.
12013000302023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2775577.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 12013000302023 its reverse (32020300031021), we get a palindrome (44033300333044).
The spelling of 12013000302023 in words is "twelve trillion, thirteen billion, three hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •