Base | Representation |
---|---|
bin | 10110101000011011… |
… | …01110100100011001 |
3 | 1011100202221100022021 |
4 | 23110031232210121 |
5 | 144340434144001 |
6 | 5325355054441 |
7 | 610044604624 |
oct | 132415564431 |
9 | 34322840267 |
10 | 12150303001 |
11 | 5175590531 |
12 | 2431141421 |
13 | 11b833b605 |
14 | 833984dbb |
15 | 4b1a5eba1 |
hex | 2d436e919 |
12150303001 has 8 divisors (see below), whose sum is σ = 12418344000. Its totient is φ = 11884332240.
The previous prime is 12150302993. The next prime is 12150303079. The reversal of 12150303001 is 10030305121.
12150303001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12150303001 - 23 = 12150302993 is a prime.
It is a super-2 number, since 2×121503030012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12150313001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 505690 + ... + 529171.
It is an arithmetic number, because the mean of its divisors is an integer number (1552293000).
Almost surely, 212150303001 is an apocalyptic number.
It is an amenable number.
12150303001 is a deficient number, since it is larger than the sum of its proper divisors (268040999).
12150303001 is a wasteful number, since it uses less digits than its factorization.
12150303001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1035119.
The product of its (nonzero) digits is 90, while the sum is 16.
Adding to 12150303001 its reverse (10030305121), we get a palindrome (22180608122).
The spelling of 12150303001 in words is "twelve billion, one hundred fifty million, three hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •