Base | Representation |
---|---|
bin | 1000101001111011… |
… | …00111100111001100 |
3 | 102222211112000120211 |
4 | 10110331213213030 |
5 | 34004021232102 |
6 | 2045030052204 |
7 | 223101666160 |
oct | 42475474714 |
9 | 12884460524 |
10 | 4646664652 |
11 | 1a74a14a23 |
12 | a981aa064 |
13 | 5908a8516 |
14 | 3211a6ca0 |
15 | 1c2e0e7d7 |
hex | 114f679cc |
4646664652 has 24 divisors (see below), whose sum is σ = 9450846720. Its totient is φ = 1957674000.
The previous prime is 4646664641. The next prime is 4646664653. The reversal of 4646664652 is 2564666464.
It is a super-2 number, since 2×46466646522 = 43182984776292562208, which contains 22 as substring.
It is a hoax number, since the sum of its digits (49) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 4646664596 and 4646664605.
It is not an unprimeable number, because it can be changed into a prime (4646664653) 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, 1404724 + ... + 1408027.
It is an arithmetic number, because the mean of its divisors is an integer number (393785280).
Almost surely, 24646664652 is an apocalyptic number.
It is an amenable number.
4646664652 is an abundant number, since it is smaller than the sum of its proper divisors (4804182068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4646664652 is a wasteful number, since it uses less digits than its factorization.
4646664652 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2812821 (or 2812819 counting only the distinct ones).
The product of its digits is 4976640, while the sum is 49.
The square root of 4646664652 is about 68166.4481398290. The cubic root of 4646664652 is about 1668.7083672051.
The spelling of 4646664652 in words is "four billion, six hundred forty-six million, six hundred sixty-four thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •