Base | Representation |
---|---|
bin | 1011000111011010100101… |
… | …0110100110001010010111 |
3 | 1121021102011210221210110212 |
4 | 2301312221112212022113 |
5 | 3100221200421330403 |
6 | 41554415302240035 |
7 | 2401004062226321 |
oct | 261665126461227 |
9 | 47242153853425 |
10 | 12222023230103 |
11 | 3992370538815 |
12 | 1454862a2601b |
13 | 6a86bb60545b |
14 | 30379896a611 |
15 | 162dc9a614d8 |
hex | b1da95a6297 |
12222023230103 has 8 divisors (see below), whose sum is σ = 12571865322240. Its totient is φ = 11875922764920.
The previous prime is 12222023230097. The next prime is 12222023230139. The reversal of 12222023230103 is 30103232022221.
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 12222023230103 - 216 = 12222023164567 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12222023230163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 935400113 + ... + 935413178.
It is an arithmetic number, because the mean of its divisors is an integer number (1571483165280).
Almost surely, 212222023230103 is an apocalyptic number.
12222023230103 is a deficient number, since it is larger than the sum of its proper divisors (349842092137).
12222023230103 is a wasteful number, since it uses less digits than its factorization.
12222023230103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1870813477.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 12222023230103 its reverse (30103232022221), we get a palindrome (42325255252324).
The spelling of 12222023230103 in words is "twelve trillion, two hundred twenty-two billion, twenty-three million, two hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •