Base | Representation |
---|---|
bin | 1011001101001111110010… |
… | …0010001011001100010101 |
3 | 1121121222202111220111222110 |
4 | 2303103330202023030111 |
5 | 3103341332433201401 |
6 | 42112424131021233 |
7 | 2411151451345620 |
oct | 263237442131425 |
9 | 47558674814873 |
10 | 12322203022101 |
11 | 3a208a9404245 |
12 | 1470160a3a819 |
13 | 6b4c9544519b |
14 | 30857d82cdb7 |
15 | 1657de9629d6 |
hex | b34fc88b315 |
12322203022101 has 32 divisors (see below), whose sum is σ = 18796380438528. Its totient is φ = 7033878714240.
The previous prime is 12322203022057. The next prime is 12322203022121. The reversal of 12322203022101 is 10122030222321.
12322203022101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12322203022101 - 211 = 12322203020053 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12322203022121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 83473980 + ... + 83621466.
It is an arithmetic number, because the mean of its divisors is an integer number (587386888704).
Almost surely, 212322203022101 is an apocalyptic number.
It is an amenable number.
12322203022101 is a deficient number, since it is larger than the sum of its proper divisors (6474177416427).
12322203022101 is a wasteful number, since it uses less digits than its factorization.
12322203022101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151641.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 12322203022101 its reverse (10122030222321), we get a palindrome (22444233244422).
The spelling of 12322203022101 in words is "twelve trillion, three hundred twenty-two billion, two hundred three million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •