Base | Representation |
---|---|
bin | 1001001101001000000100… |
… | …1010101001101000101111 |
3 | 1022211120100120001211010021 |
4 | 2103102001022221220233 |
5 | 2311311013130032343 |
6 | 33305323532423011 |
7 | 2063140353361633 |
oct | 223220112515057 |
9 | 38746316054107 |
10 | 10121110002223 |
11 | 325237a815250 |
12 | 1175657317a67 |
13 | 5855552b612c |
14 | 26dc15a58dc3 |
15 | 1284175a80ed |
hex | 934812a9a2f |
10121110002223 has 16 divisors (see below), whose sum is σ = 11737399847040. Its totient is φ = 8630441028000.
The previous prime is 10121110002209. The next prime is 10121110002229. The reversal of 10121110002223 is 32220001112101.
It is not a de Polignac number, because 10121110002223 - 213 = 10121109994031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10121110002197 and 10121110002206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121110002229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 239713365 + ... + 239755582.
It is an arithmetic number, because the mean of its divisors is an integer number (733587490440).
Almost surely, 210121110002223 is an apocalyptic number.
10121110002223 is a deficient number, since it is larger than the sum of its proper divisors (1616289844817).
10121110002223 is a wasteful number, since it uses less digits than its factorization.
10121110002223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479469078.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 10121110002223 its reverse (32220001112101), we get a palindrome (42341111114324).
The spelling of 10121110002223 in words is "ten trillion, one hundred twenty-one billion, one hundred ten million, two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •