Base | Representation |
---|---|
bin | 1000011100001101011… |
… | …0101011011100100011 |
3 | 111212022002120112201212 |
4 | 2013003112223130203 |
5 | 4333440411014021 |
6 | 150341202020335 |
7 | 13322342521010 |
oct | 2070326533443 |
9 | 455262515655 |
10 | 145011423011 |
11 | 56554193454 |
12 | 241300476ab |
13 | 1089cbc0060 |
14 | 7039024707 |
15 | 3b8ab8285b |
hex | 21c35ab723 |
145011423011 has 16 divisors (see below), whose sum is σ = 181500614400. Its totient is φ = 112789659168.
The previous prime is 145011422957. The next prime is 145011423041. The reversal of 145011423011 is 110324110541.
145011423011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 145011423011 - 234 = 127831553827 is a prime.
It is a super-2 number, since 2×1450114230112 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (145011423041) 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 15 ways as a sum of consecutive naturals, for example, 13499141 + ... + 13509878.
It is an arithmetic number, because the mean of its divisors is an integer number (11343788400).
Almost surely, 2145011423011 is an apocalyptic number.
145011423011 is a deficient number, since it is larger than the sum of its proper divisors (36489191389).
145011423011 is a wasteful number, since it uses less digits than its factorization.
145011423011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27009098.
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 145011423011 its reverse (110324110541), we get a palindrome (255335533552).
The spelling of 145011423011 in words is "one hundred forty-five billion, eleven million, four hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •