Base | Representation |
---|---|
bin | 1001000110000101001010… |
… | …10000100110001000111101 |
3 | 2121210222212011111120100110 |
4 | 10203002211100212020331 |
5 | 10110140241410240331 |
6 | 110311534305420233 |
7 | 4132651056520665 |
oct | 443024520461075 |
9 | 77728764446313 |
10 | 20000140321341 |
11 | 6411014899594 |
12 | 22b01b263a679 |
13 | b2100b3a440b |
14 | 4d2024b471a5 |
15 | 24a3b2352946 |
hex | 1230a542623d |
20000140321341 has 8 divisors (see below), whose sum is σ = 26761082928160. Its totient is φ = 13286312297712.
The previous prime is 20000140321313. The next prime is 20000140321363. The reversal of 20000140321341 is 14312304100002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20000140321341 - 221 = 20000138224189 is a prime.
It is a super-2 number, since 2×200001403213412 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000140321391) 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, 11778644806 + ... + 11778646503.
It is an arithmetic number, because the mean of its divisors is an integer number (3345135366020).
Almost surely, 220000140321341 is an apocalyptic number.
It is an amenable number.
20000140321341 is a deficient number, since it is larger than the sum of its proper divisors (6760942606819).
20000140321341 is a wasteful number, since it uses less digits than its factorization.
20000140321341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23557291595.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 20000140321341 its reverse (14312304100002), we get a palindrome (34312444421343).
The spelling of 20000140321341 in words is "twenty trillion, one hundred forty million, three hundred twenty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •