Base | Representation |
---|---|
bin | 11101110000000011011… |
… | …10111100100000011011 |
3 | 10121201120001112111002002 |
4 | 32320001232330200123 |
5 | 113222012203100443 |
6 | 2101335004231215 |
7 | 133565562454055 |
oct | 16700156744033 |
9 | 3551501474062 |
10 | 1022231300123 |
11 | 364586a12800 |
12 | 14614723b50b |
13 | 7551c0137b7 |
14 | 37694bd68d5 |
15 | 1b8cd3332b8 |
hex | ee01bbc81b |
1022231300123 has 12 divisors (see below), whose sum is σ = 1124561173344. Its totient is φ = 928514175600.
The previous prime is 1022231300107. The next prime is 1022231300143. The reversal of 1022231300123 is 3210031322201.
1022231300123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1022231300123 - 24 = 1022231300107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1022231300095 and 1022231300104.
It is not an unprimeable number, because it can be changed into a prime (1022231300143) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3433811 + ... + 3719612.
It is an arithmetic number, because the mean of its divisors is an integer number (93713431112).
Almost surely, 21022231300123 is an apocalyptic number.
1022231300123 is a deficient number, since it is larger than the sum of its proper divisors (102329873221).
1022231300123 is a wasteful number, since it uses less digits than its factorization.
1022231300123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7154626 (or 7154615 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1022231300123 its reverse (3210031322201), we get a palindrome (4232262622324).
The spelling of 1022231300123 in words is "one trillion, twenty-two billion, two hundred thirty-one million, three hundred thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •