Base | Representation |
---|---|
bin | 11111111011100001101000… |
… | …110111100111011101000000 |
3 | 200102012222101212010221222221 |
4 | 133323201220313213131000 |
5 | 121401301130042320000 |
6 | 1214400353412140424 |
7 | 41402506364015236 |
oct | 3773415067473500 |
9 | 612188355127887 |
10 | 140430010120000 |
11 | 4082203a789a07 |
12 | 1390033a307714 |
13 | 60486545481a3 |
14 | 2696bc4db0956 |
15 | 1137d9085c61a |
hex | 7fb868de7740 |
140430010120000 has 70 divisors (see below), whose sum is σ = 348220785443498. Its totient is φ = 56172004032000.
The previous prime is 140430010119941. The next prime is 140430010120027. The reversal of 140430010120000 is 21010034041.
It can be written as a sum of positive squares in 5 ways, for example, as 76345374157056 + 64084635962944 = 8737584^2 + 8005288^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1755335127 + ... + 1755415126.
Almost surely, 2140430010120000 is an apocalyptic number.
140430010120000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
140430010120000 is an abundant number, since it is smaller than the sum of its proper divisors (207790775323498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140430010120000 is an frugal number, since it uses more digits than its factorization.
140430010120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3510750285 (or 3510750260 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 140430010120000 its reverse (21010034041), we get a palindrome (140451020154041).
The spelling of 140430010120000 in words is "one hundred forty trillion, four hundred thirty billion, ten million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •