Base | Representation |
---|---|
bin | 11111010010101001001… |
… | …111110010001111001001 |
3 | 21121120100201100100022122 |
4 | 133102221033302033021 |
5 | 240212330210313213 |
6 | 4323502251301025 |
7 | 311233004034104 |
oct | 37225117621711 |
9 | 7546321310278 |
10 | 2150323135433 |
11 | 759a46395410 |
12 | 2a88b6a4a775 |
13 | 127a0ba51c15 |
14 | 7610d11773b |
15 | 3ae0513ad08 |
hex | 1f4a93f23c9 |
2150323135433 has 16 divisors (see below), whose sum is σ = 2349707640000. Its totient is φ = 1951591449600.
The previous prime is 2150323135427. The next prime is 2150323135447. The reversal of 2150323135433 is 3345313230512.
It is a cyclic number.
It is not a de Polignac number, because 2150323135433 - 26 = 2150323135369 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2150323135393 and 2150323135402.
It is not an unprimeable number, because it can be changed into a prime (2150323135403) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 16021541 + ... + 16155197.
It is an arithmetic number, because the mean of its divisors is an integer number (146856727500).
Almost surely, 22150323135433 is an apocalyptic number.
It is an amenable number.
2150323135433 is a deficient number, since it is larger than the sum of its proper divisors (199384504567).
2150323135433 is a wasteful number, since it uses less digits than its factorization.
2150323135433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136088.
The product of its (nonzero) digits is 97200, while the sum is 35.
Adding to 2150323135433 its reverse (3345313230512), we get a palindrome (5495636365945).
The spelling of 2150323135433 in words is "two trillion, one hundred fifty billion, three hundred twenty-three million, one hundred thirty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •