Base | Representation |
---|---|
bin | 1001001110010010001101… |
… | …0111011000111110000010 |
3 | 1022220110201111112100110112 |
4 | 2103210203113120332002 |
5 | 2312122242321320002 |
6 | 33322414410431322 |
7 | 2064443465160320 |
oct | 223444327307602 |
9 | 38813644470415 |
10 | 10141011120002 |
11 | 325a862446624 |
12 | 1179490132542 |
13 | 5873a734bc79 |
14 | 270b82b60d10 |
15 | 128bce7e0852 |
hex | 939235d8f82 |
10141011120002 has 8 divisors (see below), whose sum is σ = 17384590491456. Its totient is φ = 4346147622852.
The previous prime is 10141011119999. The next prime is 10141011120029. The reversal of 10141011120002 is 20002111014101.
It is a sphenic number, since it is the product of 3 distinct primes.
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: 724357937143 = 10141011120002 / (1 + 0 + 1 + 4 + 1 + 0 + 1 + 1 + 1 + 2 + 0 + 0 + 0 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 362178968558 + ... + 362178968585.
It is an arithmetic number, because the mean of its divisors is an integer number (2173073811432).
Almost surely, 210141011120002 is an apocalyptic number.
10141011120002 is a deficient number, since it is larger than the sum of its proper divisors (7243579371454).
10141011120002 is an equidigital number, since it uses as much as digits as its factorization.
10141011120002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 724357937152.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10141011120002 its reverse (20002111014101), we get a palindrome (30143122134103).
The spelling of 10141011120002 in words is "ten trillion, one hundred forty-one billion, eleven million, one hundred twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •