Base | Representation |
---|---|
bin | 1000011110011101010… |
… | …1100010100001111001 |
3 | 111220212011111201112111 |
4 | 2013213111202201321 |
5 | 4341204431312441 |
6 | 150521125012321 |
7 | 13343322651154 |
oct | 2074725424171 |
9 | 456764451474 |
10 | 145615104121 |
11 | 56833a25a63 |
12 | 2427a2540a1 |
13 | 10967ca7306 |
14 | 7095288c9b |
15 | 3bc3b7b081 |
hex | 21e7562879 |
145615104121 has 8 divisors (see below), whose sum is σ = 148952161280. Its totient is φ = 142312273488.
The previous prime is 145615104097. The next prime is 145615104143. The reversal of 145615104121 is 121401516541.
145615104121 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 a cyclic number.
It is not a de Polignac number, because 145615104121 - 227 = 145480886393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145615104161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8548026 + ... + 8565043.
It is an arithmetic number, because the mean of its divisors is an integer number (18619020160).
Almost surely, 2145615104121 is an apocalyptic number.
It is an amenable number.
145615104121 is a deficient number, since it is larger than the sum of its proper divisors (3337057159).
145615104121 is a wasteful number, since it uses less digits than its factorization.
145615104121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17113263.
The product of its (nonzero) digits is 4800, while the sum is 31.
The spelling of 145615104121 in words is "one hundred forty-five billion, six hundred fifteen million, one hundred four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •