Base | Representation |
---|---|
bin | 11001100001000100000000… |
… | …110000001111000111011101 |
3 | 112201100102201200021002121022 |
4 | 121201010000300033013131 |
5 | 104202131120024401023 |
6 | 1034402344332413525 |
7 | 32431600560330320 |
oct | 3141040060170735 |
9 | 481312650232538 |
10 | 112223213122013 |
11 | 32837663177334 |
12 | 1070573b0172a5 |
13 | 4a807b0113a46 |
14 | 1d9d8bd7da7b7 |
15 | ce92b3a217c8 |
hex | 661100c0f1dd |
112223213122013 has 32 divisors (see below), whose sum is σ = 130132032442368. Its totient is φ = 94794529003200.
The previous prime is 112223213121949. The next prime is 112223213122037. The reversal of 112223213122013 is 310221312322211.
It is a cyclic number.
It is not a de Polignac number, because 112223213122013 - 26 = 112223213121949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112223213122093) 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 31 ways as a sum of consecutive naturals, for example, 251290748 + ... + 251736938.
It is an arithmetic number, because the mean of its divisors is an integer number (4066626013824).
Almost surely, 2112223213122013 is an apocalyptic number.
It is an amenable number.
112223213122013 is a deficient number, since it is larger than the sum of its proper divisors (17908819320355).
112223213122013 is a wasteful number, since it uses less digits than its factorization.
112223213122013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 448233.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 112223213122013 its reverse (310221312322211), we get a palindrome (422444525444224).
The spelling of 112223213122013 in words is "one hundred twelve trillion, two hundred twenty-three billion, two hundred thirteen million, one hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •