Base | Representation |
---|---|
bin | 1001000111011000101110… |
… | …01110111010010110010011 |
3 | 2121222021122122221212101110 |
4 | 10203230113032322112103 |
5 | 10111404131022433121 |
6 | 110344314042304403 |
7 | 4136126561025102 |
oct | 443542716722623 |
9 | 77867578855343 |
10 | 20045002155411 |
11 | 6429046165512 |
12 | 22b8a327b8103 |
13 | b2530a79ac6c |
14 | 4d427cccc039 |
15 | 24b63aa9cd76 |
hex | 123b173ba593 |
20045002155411 has 4 divisors (see below), whose sum is σ = 26726669540552. Its totient is φ = 13363334770272.
The previous prime is 20045002155403. The next prime is 20045002155419. The reversal of 20045002155411 is 11455120054002.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (20045002155403) and next prime (20045002155419).
It is not a de Polignac number, because 20045002155411 - 23 = 20045002155403 is a prime.
It is a super-2 number, since 2×200450021554112 (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 (20045002155419) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3340833692566 + ... + 3340833692571.
It is an arithmetic number, because the mean of its divisors is an integer number (6681667385138).
Almost surely, 220045002155411 is an apocalyptic number.
20045002155411 is a deficient number, since it is larger than the sum of its proper divisors (6681667385141).
20045002155411 is an equidigital number, since it uses as much as digits as its factorization.
20045002155411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6681667385140.
The product of its (nonzero) digits is 8000, while the sum is 30.
The spelling of 20045002155411 in words is "twenty trillion, forty-five billion, two million, one hundred fifty-five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •