Base | Representation |
---|---|
bin | 10100101100101001000… |
… | …110000000110111100101 |
3 | 12000222021011211001100212 |
4 | 110230221012000313211 |
5 | 141300404321223003 |
6 | 3005223443145205 |
7 | 204521335161200 |
oct | 24545106006745 |
9 | 5028234731325 |
10 | 1422323617253 |
11 | 4a9227669350 |
12 | 1ab7a5375205 |
13 | a4180805656 |
14 | 4cbab34a937 |
15 | 26ee7db4dd8 |
hex | 14b29180de5 |
1422323617253 has 48 divisors (see below), whose sum is σ = 1858561407360. Its totient is φ = 1075666636800.
The previous prime is 1422323617243. The next prime is 1422323617277. The reversal of 1422323617253 is 3527163232241.
It is not a de Polignac number, because 1422323617253 - 224 = 1422306840037 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a self number, because there is not a number n which added to its sum of digits gives 1422323617253.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1422323617243) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4098368 + ... + 4431846.
It is an arithmetic number, because the mean of its divisors is an integer number (38720029320).
Almost surely, 21422323617253 is an apocalyptic number.
It is an amenable number.
1422323617253 is a deficient number, since it is larger than the sum of its proper divisors (436237790107).
1422323617253 is a wasteful number, since it uses less digits than its factorization.
1422323617253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 333738 (or 333731 counting only the distinct ones).
The product of its digits is 362880, while the sum is 41.
Adding to 1422323617253 its reverse (3527163232241), we get a palindrome (4949486849494).
The spelling of 1422323617253 in words is "one trillion, four hundred twenty-two billion, three hundred twenty-three million, six hundred seventeen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •