Base | Representation |
---|---|
bin | 1001001100100110111100… |
… | …00010000100011100010001 |
3 | 2122121102210101012101002021 |
4 | 10212103132002010130101 |
5 | 10122324113331122001 |
6 | 111002550403451441 |
7 | 4155111154016332 |
oct | 446233602043421 |
9 | 78542711171067 |
10 | 20224431114001 |
11 | 6498151128844 |
12 | 2327769086b81 |
13 | b3920401588a |
14 | 4dcc20d1c289 |
15 | 25113d0a8ba1 |
hex | 1264de084711 |
20224431114001 has 8 divisors (see below), whose sum is σ = 20472107239584. Its totient is φ = 19976850423840.
The previous prime is 20224431113993. The next prime is 20224431114061. The reversal of 20224431114001 is 10041113442202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20224431114001 - 23 = 20224431113993 is a prime.
It is a super-2 number, since 2×202244311140012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20224431114061) 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, 23432380 + ... + 24280141.
It is an arithmetic number, because the mean of its divisors is an integer number (2559013404948).
Almost surely, 220224431114001 is an apocalyptic number.
It is an amenable number.
20224431114001 is a deficient number, since it is larger than the sum of its proper divisors (247676125583).
20224431114001 is an equidigital number, since it uses as much as digits as its factorization.
20224431114001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47717711.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 20224431114001 its reverse (10041113442202), we get a palindrome (30265544556203).
The spelling of 20224431114001 in words is "twenty trillion, two hundred twenty-four billion, four hundred thirty-one million, one hundred fourteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •