Base | Representation |
---|---|
bin | 10001111011011001101… |
… | …001101010001011110110 |
3 | 11100210001001100112200120 |
4 | 101323121221222023312 |
5 | 130141130112120342 |
6 | 2341551213352410 |
7 | 155003261052624 |
oct | 21733151521366 |
9 | 4323031315616 |
10 | 1232012223222 |
11 | 435547866220 |
12 | 17a932498706 |
13 | 8c241816921 |
14 | 438b5cd0514 |
15 | 220aa2ddaec |
hex | 11ed9a6a2f6 |
1232012223222 has 48 divisors (see below), whose sum is σ = 2746435902912. Its totient is φ = 365393652880.
The previous prime is 1232012223209. The next prime is 1232012223257. The reversal of 1232012223222 is 2223222102321.
It is a super-2 number, since 2×12320122232222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1232012223192 and 1232012223201.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 4079388 + ... + 4370975.
It is an arithmetic number, because the mean of its divisors is an integer number (57217414644).
Almost surely, 21232012223222 is an apocalyptic number.
1232012223222 is an abundant number, since it is smaller than the sum of its proper divisors (1514423679690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1232012223222 is a wasteful number, since it uses less digits than its factorization.
1232012223222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8450473 (or 8450426 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 1232012223222 its reverse (2223222102321), we get a palindrome (3455234325543).
The spelling of 1232012223222 in words is "one trillion, two hundred thirty-two billion, twelve million, two hundred twenty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •