Base | Representation |
---|---|
bin | 1011000001000100111001… |
… | …1010000010000111110010 |
3 | 1120220000002101101012022111 |
4 | 2300101032122002013302 |
5 | 3041430134021101002 |
6 | 41432405245155534 |
7 | 2360100325356325 |
oct | 260211632020762 |
9 | 46800071335274 |
10 | 12113123222002 |
11 | 39501682a7920 |
12 | 143773055bbaa |
13 | 69b354c8563a |
14 | 2dc3c78c27bc |
15 | 1601542ec3d7 |
hex | b044e6821f2 |
12113123222002 has 32 divisors (see below), whose sum is σ = 20866381024320. Its totient is φ = 5215759672320.
The previous prime is 12113123221987. The next prime is 12113123222017. The reversal of 12113123222002 is 20022232131121.
It is an interprime number because it is at equal distance from previous prime (12113123221987) and next prime (12113123222017).
It is a super-2 number, since 2×121131232220022 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4092898 + ... + 6401410.
It is an arithmetic number, because the mean of its divisors is an integer number (652074407010).
Almost surely, 212113123222002 is an apocalyptic number.
12113123222002 is a deficient number, since it is larger than the sum of its proper divisors (8753257802318).
12113123222002 is a wasteful number, since it uses less digits than its factorization.
12113123222002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2321098.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 12113123222002 its reverse (20022232131121), we get a palindrome (32135355353123).
It can be divided in two parts, 1211 and 3123222002, that added together give a palindrome (3123223213).
The spelling of 12113123222002 in words is "twelve trillion, one hundred thirteen billion, one hundred twenty-three million, two hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •