Base | Representation |
---|---|
bin | 1011000011001111011010… |
… | …1000000110011101010001 |
3 | 1121000120001122212102101111 |
4 | 2300303312220012131101 |
5 | 3043032311114023213 |
6 | 41501435000333321 |
7 | 2362554614215162 |
oct | 260636650063521 |
9 | 47016048772344 |
10 | 12150305220433 |
11 | 3964a085a2646 |
12 | 1442988774241 |
13 | 6a19cc277043 |
14 | 300113b01769 |
15 | 1610cd6e0a3d |
hex | b0cf6a06751 |
12150305220433 has 8 divisors (see below), whose sum is σ = 12155716554048. Its totient is φ = 12144894219024.
The previous prime is 12150305220419. The next prime is 12150305220457. The reversal of 12150305220433 is 33402250305121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12150305220433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12150305220395 and 12150305220404.
It is not an unprimeable number, because it can be changed into a prime (12150305220533) 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, 98828466 + ... + 98951332.
It is an arithmetic number, because the mean of its divisors is an integer number (1519464569256).
Almost surely, 212150305220433 is an apocalyptic number.
It is an amenable number.
12150305220433 is a deficient number, since it is larger than the sum of its proper divisors (5411333615).
12150305220433 is a wasteful number, since it uses less digits than its factorization.
12150305220433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166103.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 12150305220433 its reverse (33402250305121), we get a palindrome (45552555525554).
The spelling of 12150305220433 in words is "twelve trillion, one hundred fifty billion, three hundred five million, two hundred twenty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •