Base | Representation |
---|---|
bin | 11101001010100110010… |
… | …00111001101000010110 |
3 | 10112210122121202110220122 |
4 | 32211103020321220112 |
5 | 112404321242101402 |
6 | 2044211341031542 |
7 | 132254344225331 |
oct | 16452310715026 |
9 | 3483577673818 |
10 | 1002122222102 |
11 | 356aa7961861 |
12 | 1422748555b2 |
13 | 73665b67371 |
14 | 36708239618 |
15 | 1b102c1cca2 |
hex | e953239a16 |
1002122222102 has 8 divisors (see below), whose sum is σ = 1591605882216. Its totient is φ = 471586928032.
The previous prime is 1002122222069. The next prime is 1002122222107. The reversal of 1002122222102 is 2012222212001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×10021222221023 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002122222107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14737091468 + ... + 14737091535.
It is an arithmetic number, because the mean of its divisors is an integer number (198950735277).
Almost surely, 21002122222102 is an apocalyptic number.
1002122222102 is a deficient number, since it is larger than the sum of its proper divisors (589483660114).
1002122222102 is a wasteful number, since it uses less digits than its factorization.
1002122222102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29474183022.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 1002122222102 its reverse (2012222212001), we get a palindrome (3014344434103).
The spelling of 1002122222102 in words is "one trillion, two billion, one hundred twenty-two million, two hundred twenty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •