Base | Representation |
---|---|
bin | 1000110111110100000… |
… | …0001001100010100001 |
3 | 112120102111002102012222 |
4 | 2031331000021202201 |
5 | 4444124241441213 |
6 | 154004332000425 |
7 | 14004064342445 |
oct | 2157500114241 |
9 | 476374072188 |
10 | 152421046433 |
11 | 59706786177 |
12 | 25659600115 |
13 | 114b1026906 |
14 | 753d12c825 |
15 | 3e71411808 |
hex | 237d0098a1 |
152421046433 has 4 divisors (see below), whose sum is σ = 152527412868. Its totient is φ = 152314680000.
The previous prime is 152421046429. The next prime is 152421046507. The reversal of 152421046433 is 334640124251.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 52926223249 + 99494823184 = 230057^2 + 315428^2 .
It is a cyclic number.
It is not a de Polignac number, because 152421046433 - 22 = 152421046429 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 152421046393 and 152421046402.
It is not an unprimeable number, because it can be changed into a prime (152421046423) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53181068 + ... + 53183933.
It is an arithmetic number, because the mean of its divisors is an integer number (38131853217).
Almost surely, 2152421046433 is an apocalyptic number.
It is an amenable number.
152421046433 is a deficient number, since it is larger than the sum of its proper divisors (106366435).
152421046433 is a wasteful number, since it uses less digits than its factorization.
152421046433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106366434.
The product of its (nonzero) digits is 69120, while the sum is 35.
The spelling of 152421046433 in words is "one hundred fifty-two billion, four hundred twenty-one million, forty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •