Base | Representation |
---|---|
bin | 11101011001101011111… |
… | …11011011100100101111 |
3 | 10120120120012001111022112 |
4 | 32230311333123210233 |
5 | 113022414110310043 |
6 | 2052031243434235 |
7 | 132662161652264 |
oct | 16546577334457 |
9 | 3516505044275 |
10 | 1010223135023 |
11 | 35a484694613 |
12 | 14395582597b |
13 | 7435728066b |
14 | 36c7609126b |
15 | 1b428eed518 |
hex | eb35fdb92f |
1010223135023 has 8 divisors (see below), whose sum is σ = 1055186522208. Its totient is φ = 965346468064.
The previous prime is 1010223135017. The next prime is 1010223135043. The reversal of 1010223135023 is 3205313220101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1010223135023 - 212 = 1010223130927 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1010223135023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010223135043) 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, 21656240 + ... + 21702837.
It is an arithmetic number, because the mean of its divisors is an integer number (131898315276).
Almost surely, 21010223135023 is an apocalyptic number.
1010223135023 is a deficient number, since it is larger than the sum of its proper divisors (44963387185).
1010223135023 is a wasteful number, since it uses less digits than its factorization.
1010223135023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43360113.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 1010223135023 its reverse (3205313220101), we get a palindrome (4215536355124).
The spelling of 1010223135023 in words is "one trillion, ten billion, two hundred twenty-three million, one hundred thirty-five thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •