Base | Representation |
---|---|
bin | 100001111001111111011… |
… | …111110100011100001010 |
3 | 22020202011111101000010011 |
4 | 201321333133310130022 |
5 | 301133330344301442 |
6 | 4542220432542134 |
7 | 330223565313361 |
oct | 41717737643412 |
9 | 8222144330104 |
10 | 2330011322122 |
11 | 819174714640 |
12 | 3176a40b194a |
13 | 13b946bc0643 |
14 | 80ab77467d8 |
15 | 409202a0117 |
hex | 21e7f7f470a |
2330011322122 has 32 divisors (see below), whose sum is σ = 3906377834688. Its totient is φ = 1033095600000.
The previous prime is 2330011322117. The next prime is 2330011322123. The reversal of 2330011322122 is 2212231100332.
It is a super-2 number, since 2×23300113221222 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 2330011322093 and 2330011322102.
It is not an unprimeable number, because it can be changed into a prime (2330011322123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5394372 + ... + 5810272.
It is an arithmetic number, because the mean of its divisors is an integer number (122074307334).
Almost surely, 22330011322122 is an apocalyptic number.
2330011322122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2330011322122 is a deficient number, since it is larger than the sum of its proper divisors (1576366512566).
2330011322122 is a wasteful number, since it uses less digits than its factorization.
2330011322122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422166.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 2330011322122 its reverse (2212231100332), we get a palindrome (4542242422454).
The spelling of 2330011322122 in words is "two trillion, three hundred thirty billion, eleven million, three hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •