Base | Representation |
---|---|
bin | 11111111011010010111010… |
… | …100010000001110101001100 |
3 | 200102011110121001020002012212 |
4 | 133323102322202001311030 |
5 | 121401021240240322104 |
6 | 1214345220525245552 |
7 | 41401406531660630 |
oct | 3773227242016514 |
9 | 612143531202185 |
10 | 140414200323404 |
11 | 40816367545807 |
12 | 138b92677038b8 |
13 | 6047004cc9167 |
14 | 26961253d0dc0 |
15 | 11377678d836e |
hex | 7fb4ba881d4c |
140414200323404 has 48 divisors (see below), whose sum is σ = 281281560376320. Its totient is φ = 60080446033920.
The previous prime is 140414200323379. The next prime is 140414200323427. The reversal of 140414200323404 is 404323002414041.
It is a super-2 number, since 2×1404142003234042 (a number of 29 digits) contains 22 as substring.
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, 89961164 + ... + 91508684.
It is an arithmetic number, because the mean of its divisors is an integer number (5860032507840).
Almost surely, 2140414200323404 is an apocalyptic number.
140414200323404 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
140414200323404 is an abundant number, since it is smaller than the sum of its proper divisors (140867360052916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140414200323404 is a wasteful number, since it uses less digits than its factorization.
140414200323404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1552758 (or 1552756 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 32.
Adding to 140414200323404 its reverse (404323002414041), we get a palindrome (544737202737445).
The spelling of 140414200323404 in words is "one hundred forty trillion, four hundred fourteen billion, two hundred million, three hundred twenty-three thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •