Base | Representation |
---|---|
bin | 1000011101010010100… |
… | …1110001111111100001 |
3 | 111220001022200021000222 |
4 | 2013110221301333201 |
5 | 4340034210040413 |
6 | 150430050252425 |
7 | 13332465406055 |
oct | 2072451617741 |
9 | 456038607028 |
10 | 145301643233 |
11 | 56692a9817a |
12 | 241b1287115 |
13 | 109180755b6 |
14 | 70657adc65 |
15 | 3ba63adb08 |
hex | 21d4a71fe1 |
145301643233 has 8 divisors (see below), whose sum is σ = 152979184320. Its totient is φ = 137627110800.
The previous prime is 145301643217. The next prime is 145301643301. The reversal of 145301643233 is 332346103541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 145301643233 - 24 = 145301643217 is a prime.
It is a super-2 number, since 2×1453016432332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145301643193 and 145301643202.
It is not an unprimeable number, because it can be changed into a prime (145301643533) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 652685 + ... + 846522.
It is an arithmetic number, because the mean of its divisors is an integer number (19122398040).
Almost surely, 2145301643233 is an apocalyptic number.
It is an amenable number.
145301643233 is a deficient number, since it is larger than the sum of its proper divisors (7677541087).
145301643233 is a wasteful number, since it uses less digits than its factorization.
145301643233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1504327.
The product of its (nonzero) digits is 77760, while the sum is 35.
Adding to 145301643233 its reverse (332346103541), we get a palindrome (477647746774).
The spelling of 145301643233 in words is "one hundred forty-five billion, three hundred one million, six hundred forty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •