Base | Representation |
---|---|
bin | 100011000110100010011… |
… | …000111111011010000111 |
3 | 22112121022102221222210020 |
4 | 203012202120333122013 |
5 | 304010141441110343 |
6 | 5044052213230223 |
7 | 336163410104526 |
oct | 43064230773207 |
9 | 8477272858706 |
10 | 2412201113223 |
11 | 850010708130 |
12 | 32b601332373 |
13 | 1466148c1125 |
14 | 84a732624bd |
15 | 42b30b20b83 |
hex | 231a263f687 |
2412201113223 has 16 divisors (see below), whose sum is σ = 3513195213696. Its totient is φ = 1460048798240.
The previous prime is 2412201113207. The next prime is 2412201113263. The reversal of 2412201113223 is 3223111022142.
2412201113223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 2412201113223 - 24 = 2412201113207 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2412201113193 and 2412201113202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2412201113263) 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, 47255865 + ... + 47306882.
It is an arithmetic number, because the mean of its divisors is an integer number (219574700856).
Almost surely, 22412201113223 is an apocalyptic number.
2412201113223 is a deficient number, since it is larger than the sum of its proper divisors (1100994100473).
2412201113223 is a wasteful number, since it uses less digits than its factorization.
2412201113223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94563534.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 2412201113223 its reverse (3223111022142), we get a palindrome (5635312135365).
The spelling of 2412201113223 in words is "two trillion, four hundred twelve billion, two hundred one million, one hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •