Base | Representation |
---|---|
bin | 1000011100100111010… |
… | …1010101100101110100 |
3 | 111212120200010002102201 |
4 | 2013021311111211310 |
5 | 4334201222421002 |
6 | 150400043514244 |
7 | 13325132460226 |
oct | 2071165254564 |
9 | 455520102381 |
10 | 145120123252 |
11 | 565aa587565 |
12 | 24160528984 |
13 | 108b958b920 |
14 | 704963c416 |
15 | 3b954a5087 |
hex | 21c9d55974 |
145120123252 has 12 divisors (see below), whose sum is σ = 273495616996. Its totient is φ = 66978518400.
The previous prime is 145120123217. The next prime is 145120123273. The reversal of 145120123252 is 252321021541.
It is a happy number.
145120123252 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 50573712996 + 94546410256 = 224886^2 + 307484^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 145120123252.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1395385749 + ... + 1395385852.
Almost surely, 2145120123252 is an apocalyptic number.
It is an amenable number.
145120123252 is a deficient number, since it is larger than the sum of its proper divisors (128375493744).
145120123252 is a wasteful number, since it uses less digits than its factorization.
145120123252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2790771618 (or 2790771616 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 145120123252 its reverse (252321021541), we get a palindrome (397441144793).
The spelling of 145120123252 in words is "one hundred forty-five billion, one hundred twenty million, one hundred twenty-three thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •