Base | Representation |
---|---|
bin | 1001001101001111100001… |
… | …1111101011001100011011 |
3 | 1022211202112002011221222102 |
4 | 2103103320133223030123 |
5 | 2311324113133033311 |
6 | 33310254330314015 |
7 | 2063241103163636 |
oct | 223237037531433 |
9 | 38752462157872 |
10 | 10123112002331 |
11 | 32532078a8599 |
12 | 1175b1588890b |
13 | 5857b3cb0993 |
14 | 26dd658b4c1d |
15 | 1284d321343b |
hex | 934f87eb31b |
10123112002331 has 8 divisors (see below), whose sum is σ = 10153163015424. Its totient is φ = 10093104075240.
The previous prime is 10123112002313. The next prime is 10123112002369. The reversal of 10123112002331 is 13320021132101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10123112002331 - 214 = 10123111985947 is a prime.
It is a super-2 number, since 2×101231120023312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10123112002231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10300871 + ... + 11240736.
It is an arithmetic number, because the mean of its divisors is an integer number (1269145376928).
Almost surely, 210123112002331 is an apocalyptic number.
10123112002331 is a deficient number, since it is larger than the sum of its proper divisors (30051013093).
10123112002331 is an equidigital number, since it uses as much as digits as its factorization.
10123112002331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21543001.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 10123112002331 its reverse (13320021132101), we get a palindrome (23443133134432).
The spelling of 10123112002331 in words is "ten trillion, one hundred twenty-three billion, one hundred twelve million, two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •