Base | Representation |
---|---|
bin | 10011011111001111… |
… | …010110010101000001 |
3 | 2000000022110220110201 |
4 | 103133033112111001 |
5 | 320323323240334 |
6 | 13340215525201 |
7 | 1340355236614 |
oct | 233717262501 |
9 | 60008426421 |
10 | 20925211969 |
11 | 8968811512 |
12 | 407b989801 |
13 | 1c8628ab3c |
14 | 102712617b |
15 | 8270c7c14 |
hex | 4df3d6541 |
20925211969 has 4 divisors (see below), whose sum is σ = 20944081620. Its totient is φ = 20906342320.
The previous prime is 20925211961. The next prime is 20925211997. The reversal of 20925211969 is 96911252902.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4236447744 + 16688764225 = 65088^2 + 129185^2 .
It is a cyclic number.
It is not a de Polignac number, because 20925211969 - 23 = 20925211961 is a prime.
It is a super-2 number, since 2×209252119692 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20925211961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9433162 + ... + 9435379.
It is an arithmetic number, because the mean of its divisors is an integer number (5236020405).
Almost surely, 220925211969 is an apocalyptic number.
It is an amenable number.
20925211969 is a deficient number, since it is larger than the sum of its proper divisors (18869651).
20925211969 is a wasteful number, since it uses less digits than its factorization.
20925211969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18869650.
The product of its (nonzero) digits is 174960, while the sum is 46.
The spelling of 20925211969 in words is "twenty billion, nine hundred twenty-five million, two hundred eleven thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •