Base | Representation |
---|---|
bin | 1011000111111100011010… |
… | …0011010000011110101111 |
3 | 1121022021121121012001210112 |
4 | 2301333012203100132233 |
5 | 3100343244333214043 |
6 | 42002520253530235 |
7 | 2401445064211643 |
oct | 261770643203657 |
9 | 47267547161715 |
10 | 12231103023023 |
11 | 39961aa879605 |
12 | 14565777a397b |
13 | 6a95077727a1 |
14 | 303dba7d2c23 |
15 | 16325bc50518 |
hex | b1fc68d07af |
12231103023023 has 8 divisors (see below), whose sum is σ = 12235026879888. Its totient is φ = 12227179434624.
The previous prime is 12231103022959. The next prime is 12231103023053. The reversal of 12231103023023 is 32032030113221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12231103023023 - 26 = 12231103022959 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12231103023023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12231103023053) 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, 130366736 + ... + 130460522.
It is an arithmetic number, because the mean of its divisors is an integer number (1529378359986).
Almost surely, 212231103023023 is an apocalyptic number.
12231103023023 is a deficient number, since it is larger than the sum of its proper divisors (3923856865).
12231103023023 is an equidigital number, since it uses as much as digits as its factorization.
12231103023023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134233.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 12231103023023 its reverse (32032030113221), we get a palindrome (44263133136244).
The spelling of 12231103023023 in words is "twelve trillion, two hundred thirty-one billion, one hundred three million, twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.221 sec. • engine limits •