Base | Representation |
---|---|
bin | 1001010001101110011010… |
… | …0110001001110011010010 |
3 | 1100010010021222102120110212 |
4 | 2110123212212021303102 |
5 | 2314104322001401002 |
6 | 33405512043124122 |
7 | 2101635336664550 |
oct | 224334646116322 |
9 | 40103258376425 |
10 | 10200121122002 |
11 | 3282935502a49 |
12 | 1188a27b13642 |
13 | 58cb375a5206 |
14 | 27398d33cbd0 |
15 | 12a4ddd40352 |
hex | 946e6989cd2 |
10200121122002 has 8 divisors (see below), whose sum is σ = 17485921923456. Its totient is φ = 4371480480852.
The previous prime is 10200121121969. The next prime is 10200121122029. The reversal of 10200121122002 is 20022112100201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×102001211220022 (a number of 27 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: 728580080143 = 10200121122002 / (1 + 0 + 2 + 0 + 0 + 1 + 2 + 1 + 1 + 2 + 2 + 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, 364290040058 + ... + 364290040085.
It is an arithmetic number, because the mean of its divisors is an integer number (2185740240432).
Almost surely, 210200121122002 is an apocalyptic number.
10200121122002 is a deficient number, since it is larger than the sum of its proper divisors (7285800801454).
10200121122002 is an equidigital number, since it uses as much as digits as its factorization.
10200121122002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 728580080152.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10200121122002 its reverse (20022112100201), we get a palindrome (30222233222203).
The spelling of 10200121122002 in words is "ten trillion, two hundred billion, one hundred twenty-one million, one hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •