Base | Representation |
---|---|
bin | 1001000110000101010101… |
… | …00110110010001111001111 |
3 | 2121211000002102021221110110 |
4 | 10203002222212302033033 |
5 | 10110140432341233033 |
6 | 110311551232211103 |
7 | 4132653226135125 |
oct | 443025246621717 |
9 | 77730072257413 |
10 | 20000230024143 |
11 | 6411060497636 |
12 | 22b0218699a93 |
13 | b21023b50cb5 |
14 | 4d2032a17915 |
15 | 24a3ba171363 |
hex | 1230aa9b23cf |
20000230024143 has 32 divisors (see below), whose sum is σ = 27862343608320. Its totient is φ = 12737304419840.
The previous prime is 20000230024087. The next prime is 20000230024223. The reversal of 20000230024143 is 34142003200002.
It is a cyclic number.
It is not a de Polignac number, because 20000230024143 - 232 = 19995935056847 is a prime.
It is a super-2 number, since 2×200002300241432 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000230028143) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 357828343 + ... + 357884231.
It is an arithmetic number, because the mean of its divisors is an integer number (870698237760).
Almost surely, 220000230024143 is an apocalyptic number.
20000230024143 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
20000230024143 is a deficient number, since it is larger than the sum of its proper divisors (7862113584177).
20000230024143 is a wasteful number, since it uses less digits than its factorization.
20000230024143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62519.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 20000230024143 its reverse (34142003200002), we get a palindrome (54142233224145).
The spelling of 20000230024143 in words is "twenty trillion, two hundred thirty million, twenty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •