Base | Representation |
---|---|
bin | 1000011101011000011… |
… | …0110001011000100101 |
3 | 111220010000112201212010 |
4 | 2013112012301120211 |
5 | 4340111430121013 |
6 | 150432320544433 |
7 | 13333212534540 |
oct | 2072606613045 |
9 | 456100481763 |
10 | 145326020133 |
11 | 566a5827978 |
12 | 241b9482119 |
13 | 1092012bcb8 |
14 | 7068b17857 |
15 | 3ba85c67c3 |
hex | 21d61b1625 |
145326020133 has 16 divisors (see below), whose sum is σ = 222935414400. Its totient is φ = 82486099776.
The previous prime is 145326020069. The next prime is 145326020149. The reversal of 145326020133 is 331020623541.
It is not a de Polignac number, because 145326020133 - 26 = 145326020069 is a prime.
It is a super-2 number, since 2×1453260201332 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 145326020133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145326020173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23219310 + ... + 23225567.
It is an arithmetic number, because the mean of its divisors is an integer number (13933463400).
Almost surely, 2145326020133 is an apocalyptic number.
It is an amenable number.
145326020133 is a deficient number, since it is larger than the sum of its proper divisors (77609394267).
145326020133 is a wasteful number, since it uses less digits than its factorization.
145326020133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46445036.
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 145326020133 its reverse (331020623541), we get a palindrome (476346643674).
The spelling of 145326020133 in words is "one hundred forty-five billion, three hundred twenty-six million, twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •