Base | Representation |
---|---|
bin | 10000001011101110111… |
… | …111010000001001101010 |
3 | 10221022112221021110102212 |
4 | 100023232333100021222 |
5 | 121210100421333002 |
6 | 2210521412525122 |
7 | 143230102362140 |
oct | 20135677201152 |
9 | 3838487243385 |
10 | 1112111121002 |
11 | 39970980a502 |
12 | 15b64b9207a2 |
13 | 80b43c7846b |
14 | 3bb7db6d590 |
15 | 1ddddd71352 |
hex | 102eefd026a |
1112111121002 has 8 divisors (see below), whose sum is σ = 1906476207456. Its totient is φ = 476619051852.
The previous prime is 1112111120983. The next prime is 1112111121007. The reversal of 1112111121002 is 2001211112111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×11121111210022 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 79436508643 = 1112111121002 / (1 + 1 + 1 + 2 + 1 + 1 + 1 + 1 + 2 + 1 + 0 + 0 + 2).
It is not an unprimeable number, because it can be changed into a prime (1112111121007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39718254308 + ... + 39718254335.
It is an arithmetic number, because the mean of its divisors is an integer number (238309525932).
Almost surely, 21112111121002 is an apocalyptic number.
1112111121002 is a deficient number, since it is larger than the sum of its proper divisors (794365086454).
1112111121002 is an equidigital number, since it uses as much as digits as its factorization.
1112111121002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79436508652.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 1112111121002 its reverse (2001211112111), we get a palindrome (3113322233113).
The spelling of 1112111121002 in words is "one trillion, one hundred twelve billion, one hundred eleven million, one hundred twenty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •