Base | Representation |
---|---|
bin | 1010111010100011111101… |
… | …1001010000010100110110 |
3 | 1120111022012102020201000112 |
4 | 2232220333121100110312 |
5 | 3033111430231210402 |
6 | 41305135353343022 |
7 | 2346025656434150 |
oct | 256507731202466 |
9 | 46438172221015 |
10 | 12001202210102 |
11 | 3907754860076 |
12 | 1419ab6407a72 |
13 | 6909297a9001 |
14 | 2d6c0b525ad0 |
15 | 15c2a3745e52 |
hex | aea3f650536 |
12001202210102 has 8 divisors (see below), whose sum is σ = 20573489503056. Its totient is φ = 5143372375752.
The previous prime is 12001202210089. The next prime is 12001202210119. The reversal of 12001202210102 is 20101220210021.
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: 857228729293 = 12001202210102 / (1 + 2 + 0 + 0 + 1 + 2 + 0 + 2 + 2 + 1 + 0 + 1 + 0 + 2).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 428614364633 + ... + 428614364660.
It is an arithmetic number, because the mean of its divisors is an integer number (2571686187882).
Almost surely, 212001202210102 is an apocalyptic number.
12001202210102 is a deficient number, since it is larger than the sum of its proper divisors (8572287292954).
12001202210102 is an equidigital number, since it uses as much as digits as its factorization.
12001202210102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 857228729302.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12001202210102 its reverse (20101220210021), we get a palindrome (32102422420123).
The spelling of 12001202210102 in words is "twelve trillion, one billion, two hundred two million, two hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •