Base | Representation |
---|---|
bin | 100001000010011100111010… |
… | …100011110000111110001111 |
3 | 201001110221002001120221201002 |
4 | 201002130322203300332033 |
5 | 123021130113341421020 |
6 | 1233011425025410515 |
7 | 42414604045221341 |
oct | 4102347243607617 |
9 | 631427061527632 |
10 | 145304021045135 |
11 | 423310a88a27a7 |
12 | 14368a86799a3b |
13 | 63101586b2cc4 |
14 | 27c4a75c47291 |
15 | 11bea573ec975 |
hex | 84273a8f0f8f |
145304021045135 has 16 divisors (see below), whose sum is σ = 181587992076000. Its totient is φ = 111481576139136.
The previous prime is 145304021045119. The next prime is 145304021045179. The reversal of 145304021045135 is 531540120403541.
145304021045135 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 145304021045135 - 24 = 145304021045119 is a prime.
It is a super-2 number, since 2×1453040210451352 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3362718989 + ... + 3362762198.
It is an arithmetic number, because the mean of its divisors is an integer number (11349249504750).
Almost surely, 2145304021045135 is an apocalyptic number.
145304021045135 is a deficient number, since it is larger than the sum of its proper divisors (36283971030865).
145304021045135 is a wasteful number, since it uses less digits than its factorization.
145304021045135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6725481370.
The product of its (nonzero) digits is 144000, while the sum is 38.
Adding to 145304021045135 its reverse (531540120403541), we get a palindrome (676844141448676).
The spelling of 145304021045135 in words is "one hundred forty-five trillion, three hundred four billion, twenty-one million, forty-five thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •