Base | Representation |
---|---|
bin | 1010010100001011… |
… | …1111000110101001 |
3 | 21010222101222000021 |
4 | 2211002333012221 |
5 | 21132332222101 |
6 | 1134433440441 |
7 | 125422211344 |
oct | 24502770651 |
9 | 7128358007 |
10 | 2769023401 |
11 | 11a10502a1 |
12 | 653410121 |
13 | 3518a28b1 |
14 | 1c3a7d45b |
15 | 11316b5a1 |
hex | a50bf1a9 |
2769023401 has 4 divisors (see below), whose sum is σ = 2797570132. Its totient is φ = 2740476672.
The previous prime is 2769023347. The next prime is 2769023417. The reversal of 2769023401 is 1043209672.
2769023401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1040127001 + 1728896400 = 32251^2 + 41580^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2769023401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2769023701) 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, 14273220 + ... + 14273413.
It is an arithmetic number, because the mean of its divisors is an integer number (699392533).
Almost surely, 22769023401 is an apocalyptic number.
It is an amenable number.
2769023401 is a deficient number, since it is larger than the sum of its proper divisors (28546731).
2769023401 is an equidigital number, since it uses as much as digits as its factorization.
2769023401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28546730.
The product of its (nonzero) digits is 18144, while the sum is 34.
The square root of 2769023401 is about 52621.5108201960. The cubic root of 2769023401 is about 1404.2428092882.
The spelling of 2769023401 in words is "two billion, seven hundred sixty-nine million, twenty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •