Base | Representation |
---|---|
bin | 1001001101100001… |
… | …1101101111000001 |
3 | 20101022202100100012 |
4 | 2103120131233001 |
5 | 20031000222001 |
6 | 1045205434305 |
7 | 115163203643 |
oct | 22330355701 |
9 | 6338670305 |
10 | 2472664001 |
11 | 1059833075 |
12 | 59010b995 |
13 | 30537abc2 |
14 | 196576893 |
15 | e712b2bb |
hex | 9361dbc1 |
2472664001 has 8 divisors (see below), whose sum is σ = 2487993984. Its totient is φ = 2457378000.
The previous prime is 2472663997. The next prime is 2472664003. The reversal of 2472664001 is 1004662742.
2472664001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2472664001 - 22 = 2472663997 is a prime.
It is a super-2 number, since 2×24726640012 = 12228134523682656002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2472664003) 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, 105575 + ... + 126851.
It is an arithmetic number, because the mean of its divisors is an integer number (310999248).
Almost surely, 22472664001 is an apocalyptic number.
It is an amenable number.
2472664001 is a deficient number, since it is larger than the sum of its proper divisors (15329983).
2472664001 is a wasteful number, since it uses less digits than its factorization.
2472664001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21991.
The product of its (nonzero) digits is 16128, while the sum is 32.
The square root of 2472664001 is about 49725.8886396211. Note that the first 3 decimals coincide. The cubic root of 2472664001 is about 1352.2439135532.
The spelling of 2472664001 in words is "two billion, four hundred seventy-two million, six hundred sixty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •