Base | Representation |
---|---|
bin | 100000011101000100000… |
… | …100101101011110000101 |
3 | 21220012121120102100100012 |
4 | 200131010010231132011 |
5 | 243020002402042013 |
6 | 4424315323200005 |
7 | 320062116111542 |
oct | 40350404553605 |
9 | 7805546370305 |
10 | 2230230112133 |
11 | 78a920835731 |
12 | 300297676005 |
13 | 13240481695a |
14 | 79d2d799bc9 |
15 | 3d0303821a8 |
hex | 2074412d785 |
2230230112133 has 16 divisors (see below), whose sum is σ = 2336703005184. Its totient is φ = 2125920012480.
The previous prime is 2230230112091. The next prime is 2230230112141. The reversal of 2230230112133 is 3312110320322.
It is not a de Polignac number, because 2230230112133 - 26 = 2230230112069 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2230230112099 and 2230230112108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2230230112433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37266791 + ... + 37326587.
It is an arithmetic number, because the mean of its divisors is an integer number (146043937824).
Almost surely, 22230230112133 is an apocalyptic number.
It is an amenable number.
2230230112133 is a deficient number, since it is larger than the sum of its proper divisors (106472893051).
2230230112133 is a wasteful number, since it uses less digits than its factorization.
2230230112133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77852.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 2230230112133 its reverse (3312110320322), we get a palindrome (5542340432455).
The spelling of 2230230112133 in words is "two trillion, two hundred thirty billion, two hundred thirty million, one hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •