Base | Representation |
---|---|
bin | 100010110010110001110011… |
… | …011001111101000011011011 |
3 | 202001210212012010122100212210 |
4 | 202302301303121331003123 |
5 | 130024112131414133103 |
6 | 1301241450542010203 |
7 | 44142356234264016 |
oct | 4262616331750333 |
9 | 661725163570783 |
10 | 153023031005403 |
11 | 448377807781a9 |
12 | 151b4a7b576963 |
13 | 67500189c2760 |
14 | 29b04d5d9237d |
15 | 12a5730a59e03 |
hex | 8b2c7367d0db |
153023031005403 has 8 divisors (see below), whose sum is σ = 219725377853968. Its totient is φ = 94168019080224.
The previous prime is 153023031005333. The next prime is 153023031005407. The reversal of 153023031005403 is 304500130320351.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 153023031005403 - 220 = 153023029956827 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (153023031005407) 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, 1961833730800 + ... + 1961833730877.
It is an arithmetic number, because the mean of its divisors is an integer number (27465672231746).
Almost surely, 2153023031005403 is an apocalyptic number.
153023031005403 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
153023031005403 is a deficient number, since it is larger than the sum of its proper divisors (66702346848565).
153023031005403 is a wasteful number, since it uses less digits than its factorization.
153023031005403 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3923667461693.
The product of its (nonzero) digits is 16200, while the sum is 30.
Adding to 153023031005403 its reverse (304500130320351), we get a palindrome (457523161325754).
The spelling of 153023031005403 in words is "one hundred fifty-three trillion, twenty-three billion, thirty-one million, five thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •