Base | Representation |
---|---|
bin | 11111110101110000000001… |
… | …101000110111110100100001 |
3 | 200100211001000101021110120021 |
4 | 133311300001220313310201 |
5 | 121323300333122213101 |
6 | 1213454200442113441 |
7 | 41332026531651535 |
oct | 3765600150676441 |
9 | 610731011243507 |
10 | 140033141210401 |
11 | 406897a361412a |
12 | 1385743b7ab881 |
13 | 601a0b77cc27a |
14 | 26818d69b9bc5 |
15 | 112c8b3c9e5a1 |
hex | 7f5c01a37d21 |
140033141210401 has 16 divisors (see below), whose sum is σ = 144000093168000. Its totient is φ = 136075793125248.
The previous prime is 140033141210393. The next prime is 140033141210423. The reversal of 140033141210401 is 104012141330041.
It is a cyclic number.
It is not a de Polignac number, because 140033141210401 - 23 = 140033141210393 is a prime.
It is a super-3 number, since 3×1400331412104013 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140033141210491) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1415871250 + ... + 1415970148.
It is an arithmetic number, because the mean of its divisors is an integer number (9000005823000).
Almost surely, 2140033141210401 is an apocalyptic number.
It is an amenable number.
140033141210401 is a deficient number, since it is larger than the sum of its proper divisors (3966951957599).
140033141210401 is an equidigital number, since it uses as much as digits as its factorization.
140033141210401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147048.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 140033141210401 its reverse (104012141330041), we get a palindrome (244045282540442).
The spelling of 140033141210401 in words is "one hundred forty trillion, thirty-three billion, one hundred forty-one million, two hundred ten thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •