Base | Representation |
---|---|
bin | 1000011100101000001… |
… | …0110011001000010000 |
3 | 111212120220202101010020 |
4 | 2013022002303020100 |
5 | 4334203123331422 |
6 | 150400251303440 |
7 | 13325204455365 |
oct | 2071202631020 |
9 | 455526671106 |
10 | 145123652112 |
11 | 5660157787a |
12 | 2416174ab80 |
13 | 108ba225bca |
14 | 7049cba46c |
15 | 3b9595095c |
hex | 21ca0b3210 |
145123652112 has 20 divisors (see below), whose sum is σ = 374902768080. Its totient is φ = 48374550688.
The previous prime is 145123652059. The next prime is 145123652129. The reversal of 145123652112 is 211256321541.
145123652112 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1511704662 + ... + 1511704757.
It is an arithmetic number, because the mean of its divisors is an integer number (18745138404).
Almost surely, 2145123652112 is an apocalyptic number.
145123652112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
145123652112 is an abundant number, since it is smaller than the sum of its proper divisors (229779115968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145123652112 is a wasteful number, since it uses less digits than its factorization.
145123652112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3023409430 (or 3023409424 counting only the distinct ones).
The product of its digits is 14400, while the sum is 33.
Adding to 145123652112 its reverse (211256321541), we get a palindrome (356379973653).
The spelling of 145123652112 in words is "one hundred forty-five billion, one hundred twenty-three million, six hundred fifty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •