Base | Representation |
---|---|
bin | 1001010011000100011111… |
… | …1111111111100001111001 |
3 | 1100012022221111002102002120 |
4 | 2110301013333333201321 |
5 | 2314444133402401410 |
6 | 33424253113151453 |
7 | 2103414113152650 |
oct | 224610777774171 |
9 | 40168844072076 |
10 | 10223230122105 |
11 | 3291713980840 |
12 | 11913b70bb589 |
13 | 59207b109580 |
14 | 274b424c2197 |
15 | 12ade29d1570 |
hex | 94c47fff879 |
10223230122105 has 64 divisors (see below), whose sum is σ = 21962072014848. Its totient is φ = 3921798562560.
The previous prime is 10223230122059. The next prime is 10223230122139. The reversal of 10223230122105 is 50122103232201.
It is not a de Polignac number, because 10223230122105 - 26 = 10223230122041 is a prime.
It is a super-3 number, since 3×102232301221053 (a number of 40 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 340418889 + ... + 340448918.
It is an arithmetic number, because the mean of its divisors is an integer number (343157375232).
Almost surely, 210223230122105 is an apocalyptic number.
10223230122105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10223230122105 is an abundant number, since it is smaller than the sum of its proper divisors (11738841892743).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10223230122105 is a wasteful number, since it uses less digits than its factorization.
10223230122105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 680867846.
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 10223230122105 its reverse (50122103232201), we get a palindrome (60345333354306).
The spelling of 10223230122105 in words is "ten trillion, two hundred twenty-three billion, two hundred thirty million, one hundred twenty-two thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •