Base | Representation |
---|---|
bin | 1001110010111010… |
… | …1101011001100001 |
3 | 20210020211221112122 |
4 | 2130232231121201 |
5 | 20341122142043 |
6 | 1112531034025 |
7 | 122106204254 |
oct | 23456553141 |
9 | 6706757478 |
10 | 2629490273 |
11 | 112a307a63 |
12 | 61473b915 |
13 | 32b9c9c07 |
14 | 1ad31b09b |
15 | 105ca8368 |
hex | 9cbad661 |
2629490273 has 8 divisors (see below), whose sum is σ = 2666131200. Its totient is φ = 2592933408.
The previous prime is 2629490263. The next prime is 2629490321. The reversal of 2629490273 is 3720949262.
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 2629490273 - 26 = 2629490209 is a prime.
It is a super-2 number, since 2×26294902732 = 13828438191603229058, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2629490243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43340 + ... + 84482.
It is an arithmetic number, because the mean of its divisors is an integer number (333266400).
Almost surely, 22629490273 is an apocalyptic number.
It is an amenable number.
2629490273 is a deficient number, since it is larger than the sum of its proper divisors (36640927).
2629490273 is an equidigital number, since it uses as much as digits as its factorization.
2629490273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42031.
The product of its (nonzero) digits is 326592, while the sum is 44.
The square root of 2629490273 is about 51278.5556836384. Note that the first 3 decimals coincide. The cubic root of 2629490273 is about 1380.2482002987.
The spelling of 2629490273 in words is "two billion, six hundred twenty-nine million, four hundred ninety thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •