Base | Representation |
---|---|
bin | 1010111010100000100110… |
… | …1011110010111111100101 |
3 | 1120111012212121122121202102 |
4 | 2232220021223302333211 |
5 | 3033103104040213104 |
6 | 41304510123421445 |
7 | 2345664435226043 |
oct | 256501153627745 |
9 | 46435777577672 |
10 | 12000301101029 |
11 | 390733214052a |
12 | 14198a4684885 |
13 | 690814bb4887 |
14 | 2d6b6399b393 |
15 | 15c24e59aa1e |
hex | aea09af2fe5 |
12000301101029 has 8 divisors (see below), whose sum is σ = 12633207948000. Its totient is φ = 11367525459312.
The previous prime is 12000301101011. The next prime is 12000301101031. The reversal of 12000301101029 is 92010110300021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12000301101029 - 240 = 10900789473253 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12000301101029.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12000301101079) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32613539 + ... + 32979440.
It is an arithmetic number, because the mean of its divisors is an integer number (1579150993500).
Almost surely, 212000301101029 is an apocalyptic number.
12000301101029 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
12000301101029 is a deficient number, since it is larger than the sum of its proper divisors (632906846971).
12000301101029 is an equidigital number, since it uses as much as digits as its factorization.
12000301101029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65602627.
The product of its (nonzero) digits is 108, while the sum is 20.
The spelling of 12000301101029 in words is "twelve trillion, three hundred one million, one hundred one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •