Base | Representation |
---|---|
bin | 100010110101100010001101… |
… | …111001101110100110001001 |
3 | 202002110222010100121202112012 |
4 | 202311202031321232212021 |
5 | 130040213101222302213 |
6 | 1301504455120225305 |
7 | 44162143304121104 |
oct | 4265421571564611 |
9 | 662428110552465 |
10 | 153212454103433 |
11 | 449000451123aa |
12 | 15225724a6b235 |
13 | 6764b4595514a |
14 | 29b974545b73b |
15 | 12aa61a6674a8 |
hex | 8b588de6e989 |
153212454103433 has 8 divisors (see below), whose sum is σ = 158161629424896. Its totient is φ = 148263706162800.
The previous prime is 153212454103409. The next prime is 153212454103453. The reversal of 153212454103433 is 334301454212351.
153212454103433 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 153212454103433 - 216 = 153212454037897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (153212454103453) 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, 106116566 + ... + 107550687.
It is an arithmetic number, because the mean of its divisors is an integer number (19770203678112).
Almost surely, 2153212454103433 is an apocalyptic number.
It is an amenable number.
153212454103433 is a deficient number, since it is larger than the sum of its proper divisors (4949175321463).
153212454103433 is a wasteful number, since it uses less digits than its factorization.
153212454103433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 213690415.
The product of its (nonzero) digits is 518400, while the sum is 41.
The spelling of 153212454103433 in words is "one hundred fifty-three trillion, two hundred twelve billion, four hundred fifty-four million, one hundred three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •