Base | Representation |
---|---|
bin | 11111111011100001110110… |
… | …001001111101011001101101 |
3 | 200102012222222101121002012002 |
4 | 133323201312021331121231 |
5 | 121401302104124013201 |
6 | 1214400431454022045 |
7 | 41402515041521312 |
oct | 3773416611753155 |
9 | 612188871532162 |
10 | 140430233032301 |
11 | 408221445a1253 |
12 | 139003a0aa7925 |
13 | 604868b795364 |
14 | 2696c06838d09 |
15 | 1137da51e076b |
hex | 7fb87627d66d |
140430233032301 has 8 divisors (see below), whose sum is σ = 145423372318464. Its totient is φ = 135466039481760.
The previous prime is 140430233032291. The next prime is 140430233032381. The reversal of 140430233032301 is 103230332034041.
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 140430233032301 - 242 = 136032186521197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140430233032381) 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, 7236424031 + ... + 7236443436.
It is an arithmetic number, because the mean of its divisors is an integer number (18177921539808).
Almost surely, 2140430233032301 is an apocalyptic number.
It is an amenable number.
140430233032301 is a deficient number, since it is larger than the sum of its proper divisors (4993139286163).
140430233032301 is a wasteful number, since it uses less digits than its factorization.
140430233032301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14472867811.
The product of its (nonzero) digits is 15552, while the sum is 29.
Adding to 140430233032301 its reverse (103230332034041), we get a palindrome (243660565066342).
The spelling of 140430233032301 in words is "one hundred forty trillion, four hundred thirty billion, two hundred thirty-three million, thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •