Base | Representation |
---|---|
bin | 1011000110101110010000… |
… | …0010111100011010011111 |
3 | 1121020021110110122002220020 |
4 | 2301223210002330122133 |
5 | 3100022312444012343 |
6 | 41545130355523223 |
7 | 2400103142222004 |
oct | 261534402743237 |
9 | 47207413562806 |
10 | 12210123032223 |
11 | 3988314152a36 |
12 | 14524a15b9513 |
13 | 6a754304534c |
14 | 302d8a2cb8ab |
15 | 16292ee56b83 |
hex | b1ae40bc69f |
12210123032223 has 16 divisors (see below), whose sum is σ = 16378352137440. Its totient is φ = 8091011441024.
The previous prime is 12210123032197. The next prime is 12210123032267. The reversal of 12210123032223 is 32223032101221.
It is a cyclic number.
It is not a de Polignac number, because 12210123032223 - 224 = 12210106255007 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12210123032193 and 12210123032202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12210123042223) 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 15 ways as a sum of consecutive naturals, for example, 848508 + ... + 5014001.
It is an arithmetic number, because the mean of its divisors is an integer number (1023647008590).
Almost surely, 212210123032223 is an apocalyptic number.
12210123032223 is a deficient number, since it is larger than the sum of its proper divisors (4168229105217).
12210123032223 is a wasteful number, since it uses less digits than its factorization.
12210123032223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5866698.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 12210123032223 its reverse (32223032101221), we get a palindrome (44433155133444).
The spelling of 12210123032223 in words is "twelve trillion, two hundred ten billion, one hundred twenty-three million, thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •