Base | Representation |
---|---|
bin | 1101001100001001111… |
… | …10111110101000010011 |
3 | 1121022210110202221020220 |
4 | 12212010332332220103 |
5 | 24411124340334201 |
6 | 544110510004123 |
7 | 44512533055260 |
oct | 6460476765023 |
9 | 1538713687226 |
10 | 453202668051 |
11 | 165225100351 |
12 | 73a007a6643 |
13 | 33976a72103 |
14 | 17d13db4267 |
15 | bbc7517036 |
hex | 6984fbea13 |
453202668051 has 32 divisors (see below), whose sum is σ = 707531328000. Its totient is φ = 252623320320.
The previous prime is 453202668013. The next prime is 453202668077. The reversal of 453202668051 is 150866202354.
It is not a de Polignac number, because 453202668051 - 26 = 453202667987 is a prime.
It is a super-2 number, since 2×4532026680512 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 453202667994 and 453202668012.
It is not an unprimeable number, because it can be changed into a prime (453202668091) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7459585 + ... + 7520093.
It is an arithmetic number, because the mean of its divisors is an integer number (22110354000).
Almost surely, 2453202668051 is an apocalyptic number.
453202668051 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
453202668051 is a deficient number, since it is larger than the sum of its proper divisors (254328659949).
453202668051 is a wasteful number, since it uses less digits than its factorization.
453202668051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69259.
The product of its (nonzero) digits is 345600, while the sum is 42.
It can be divided in two parts, 453202 and 668051, that added together give a triangular number (1121253 = T1497).
The spelling of 453202668051 in words is "four hundred fifty-three billion, two hundred two million, six hundred sixty-eight thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •