Base | Representation |
---|---|
bin | 1001001100000101011110… |
… | …0000001000001101101001 |
3 | 1022202212012112210111202211 |
4 | 2103001113200020031221 |
5 | 2311012404131321413 |
6 | 33253205454125121 |
7 | 2061635325365356 |
oct | 223012740101551 |
9 | 38685175714684 |
10 | 10103231120233 |
11 | 3245835638619 |
12 | 11720a77b07a1 |
13 | 5839661b1614 |
14 | 26cddb35962d |
15 | 127c1cb7683d |
hex | 93057808369 |
10103231120233 has 6 divisors (see below), whose sum is σ = 10561600774634. Its totient is φ = 9663960201456.
The previous prime is 10103231120231. The next prime is 10103231120243. The reversal of 10103231120233 is 33202113230101.
It can be written as a sum of positive squares in only one way, i.e., 8693699426064 + 1409531694169 = 2948508^2 + 1187237^2 .
It is not a de Polignac number, because 10103231120233 - 21 = 10103231120231 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10103231120231) 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 5 ways as a sum of consecutive naturals, for example, 9549367260 + ... + 9549368317.
Almost surely, 210103231120233 is an apocalyptic number.
It is an amenable number.
10103231120233 is a deficient number, since it is larger than the sum of its proper divisors (458369654401).
10103231120233 is an equidigital number, since it uses as much as digits as its factorization.
10103231120233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19098735623 (or 19098735600 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 10103231120233 its reverse (33202113230101), we get a palindrome (43305344350334).
The spelling of 10103231120233 in words is "ten trillion, one hundred three billion, two hundred thirty-one million, one hundred twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •