Base | Representation |
---|---|
bin | 1001001101001111001100… |
… | …1100100111111001100111 |
3 | 1022211202021212221101010011 |
4 | 2103103303030213321213 |
5 | 2311323422404401043 |
6 | 33310241433311051 |
7 | 2063235643543450 |
oct | 223236314477147 |
9 | 38752255841104 |
10 | 10123023122023 |
11 | 3253171711499 |
12 | 1175aabb65487 |
13 | 58579b761596 |
14 | 26dd57b7a127 |
15 | 1284ca50859d |
hex | 934f3327e67 |
10123023122023 has 16 divisors (see below), whose sum is σ = 11631062058304. Its totient is φ = 8630579704320.
The previous prime is 10123023121997. The next prime is 10123023122029. The reversal of 10123023122023 is 32022132032101.
It is not a de Polignac number, because 10123023122023 - 29 = 10123023121511 is a prime.
It is a super-2 number, since 2×101230231220232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10123023121985 and 10123023122003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10123023122029) 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, 4103340 + ... + 6089617.
It is an arithmetic number, because the mean of its divisors is an integer number (726941378644).
Almost surely, 210123023122023 is an apocalyptic number.
10123023122023 is a deficient number, since it is larger than the sum of its proper divisors (1508038936281).
10123023122023 is a wasteful number, since it uses less digits than its factorization.
10123023122023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10193722.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 10123023122023 its reverse (32022132032101), we get a palindrome (42145155154124).
The spelling of 10123023122023 in words is "ten trillion, one hundred twenty-three billion, twenty-three million, one hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •