Base | Representation |
---|---|
bin | 11101001010101011000… |
… | …00101100100000101101 |
3 | 10112210202101122010111000 |
4 | 32211111200230200231 |
5 | 112404411433424003 |
6 | 2044215321550513 |
7 | 132255336366411 |
oct | 16452540544055 |
9 | 3483671563430 |
10 | 1002162014253 |
11 | 357018370234 |
12 | 142286045439 |
13 | 7367118a40a |
14 | 3670d636d41 |
15 | 1b10647d1a3 |
hex | e95582c82d |
1002162014253 has 16 divisors (see below), whose sum is σ = 1484702728960. Its totient is φ = 668099791008.
The previous prime is 1002162014177. The next prime is 1002162014267. The reversal of 1002162014253 is 3524102612001.
1002162014253 is a `hidden beast` number, since 1 + 0 + 0 + 2 + 1 + 620 + 14 + 25 + 3 = 666.
It is not a de Polignac number, because 1002162014253 - 28 = 1002162013997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002162014153) 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, 2681676 + ... + 3032442.
It is an arithmetic number, because the mean of its divisors is an integer number (92793920560).
Almost surely, 21002162014253 is an apocalyptic number.
It is an amenable number.
1002162014253 is a deficient number, since it is larger than the sum of its proper divisors (482540714707).
1002162014253 is a wasteful number, since it uses less digits than its factorization.
1002162014253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 456593 (or 456587 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 1002162014253 its reverse (3524102612001), we get a palindrome (4526264626254).
The spelling of 1002162014253 in words is "one trillion, two billion, one hundred sixty-two million, fourteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •