Base | Representation |
---|---|
bin | 10111011110000110000111… |
… | …111101101010010111000100 |
3 | 111112111001012101102111210221 |
4 | 113132012013331222113010 |
5 | 102012202133402110340 |
6 | 1003312033002154124 |
7 | 30512426604100060 |
oct | 2736060775522704 |
9 | 445431171374727 |
10 | 103223230113220 |
11 | 2a9877a9413a28 |
12 | b6b142aab2944 |
13 | 4579ba7922b29 |
14 | 1b6c061098aa0 |
15 | be0116a9e44a |
hex | 5de187f6a5c4 |
103223230113220 has 48 divisors (see below), whose sum is σ = 247736483850240. Its totient is φ = 35390717241984.
The previous prime is 103223230113191. The next prime is 103223230113229. The reversal of 103223230113220 is 22311032322301.
It is not an unprimeable number, because it can be changed into a prime (103223230113229) 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, 57841117 + ... + 59599003.
It is an arithmetic number, because the mean of its divisors is an integer number (5161176746880).
Almost surely, 2103223230113220 is an apocalyptic number.
103223230113220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103223230113220 is an abundant number, since it is smaller than the sum of its proper divisors (144513253737020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103223230113220 is a wasteful number, since it uses less digits than its factorization.
103223230113220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2177332 (or 2177330 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 103223230113220 its reverse (22311032322301), we get a palindrome (125534262435521).
The spelling of 103223230113220 in words is "one hundred three trillion, two hundred twenty-three billion, two hundred thirty million, one hundred thirteen thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •