Base | Representation |
---|---|
bin | 1000111011100011101… |
… | …0011000010101100100 |
3 | 112200000112101211121211 |
4 | 2032320322120111210 |
5 | 10003204044322030 |
6 | 154252155121204 |
7 | 14041020621511 |
oct | 2167072302544 |
9 | 480015354554 |
10 | 153426167140 |
11 | 5a082087244 |
12 | 2589a143204 |
13 | 116113377ac |
14 | 75d6810308 |
15 | 3ece7a512a |
hex | 23b8e98564 |
153426167140 has 12 divisors (see below), whose sum is σ = 322194951036. Its totient is φ = 61370466848.
The previous prime is 153426167053. The next prime is 153426167143. The reversal of 153426167140 is 41761624351.
It can be written as a sum of positive squares in 2 ways, for example, as 122697479524 + 30728687616 = 350282^2 + 175296^2 .
It is a junction number, because it is equal to n+sod(n) for n = 153426167093 and 153426167102.
It is not an unprimeable number, because it can be changed into a prime (153426167143) 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, 3835654159 + ... + 3835654198.
It is an arithmetic number, because the mean of its divisors is an integer number (26849579253).
Almost surely, 2153426167140 is an apocalyptic number.
153426167140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
153426167140 is an abundant number, since it is smaller than the sum of its proper divisors (168768783896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153426167140 is a wasteful number, since it uses less digits than its factorization.
153426167140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7671308366 (or 7671308364 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 40.
The spelling of 153426167140 in words is "one hundred fifty-three billion, four hundred twenty-six million, one hundred sixty-seven thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •