Base | Representation |
---|---|
bin | 101111001011101000… |
… | …0110001001100010111 |
3 | 100200112022020001202001 |
4 | 1132113100301030113 |
5 | 3130001413100343 |
6 | 114314030100131 |
7 | 10214565550210 |
oct | 1362720611427 |
9 | 320468201661 |
10 | 101322003223 |
11 | 39a746a1751 |
12 | 1777864a647 |
13 | 972967c87c |
14 | 4c9286c407 |
15 | 298032444d |
hex | 1797431317 |
101322003223 has 16 divisors (see below), whose sum is σ = 116730224640. Its totient is φ = 86147451936.
The previous prime is 101322003221. The next prime is 101322003253. The reversal of 101322003223 is 322300223101.
It is not a de Polignac number, because 101322003223 - 21 = 101322003221 is a prime.
It is a super-2 number, since 2×1013220032232 (a number of 23 digits) contains 22 as substring.
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 101322003223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101322003221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9429588 + ... + 9440326.
It is an arithmetic number, because the mean of its divisors is an integer number (7295639040).
Almost surely, 2101322003223 is an apocalyptic number.
101322003223 is a deficient number, since it is larger than the sum of its proper divisors (15408221417).
101322003223 is a wasteful number, since it uses less digits than its factorization.
101322003223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21486.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 101322003223 its reverse (322300223101), we get a palindrome (423622226324).
The spelling of 101322003223 in words is "one hundred one billion, three hundred twenty-two million, three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •