Base | Representation |
---|---|
bin | 10011101001000100… |
… | …01000101010000010 |
3 | 1000012220100112110010 |
4 | 21310202020222002 |
5 | 133044012240002 |
6 | 4502212445350 |
7 | 522213234600 |
oct | 116442105202 |
9 | 30186315403 |
10 | 10545040002 |
11 | 45214446a2 |
12 | 2063619856 |
13 | cc08b2153 |
14 | 7206c0870 |
15 | 41ab7146c |
hex | 274888a82 |
10545040002 has 96 divisors (see below), whose sum is σ = 24852510720. Its totient is φ = 2973952800.
The previous prime is 10545039971. The next prime is 10545040003. The reversal of 10545040002 is 20004054501.
It is a super-2 number, since 2×105450400022 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (10545040003) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7945863 + ... + 7947189.
It is an arithmetic number, because the mean of its divisors is an integer number (258880320).
Almost surely, 210545040002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10545040002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12426255360).
10545040002 is an abundant number, since it is smaller than the sum of its proper divisors (14307470718).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10545040002 is a wasteful number, since it uses less digits than its factorization.
10545040002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1676 (or 1669 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 21.
Adding to 10545040002 its reverse (20004054501), we get a palindrome (30549094503).
The spelling of 10545040002 in words is "ten billion, five hundred forty-five million, forty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •