Base | Representation |
---|---|
bin | 1001100000011100100111… |
… | …1100100111110010100000 |
3 | 1101000022010120120210211021 |
4 | 2120013021330213302200 |
5 | 2332230313121340300 |
6 | 34122021212255224 |
7 | 2126131110046666 |
oct | 230071174476240 |
9 | 41008116523737 |
10 | 10453043543200 |
11 | 337012462a525 |
12 | 1209a53171514 |
13 | 5aa943c552cb |
14 | 281d03d20c36 |
15 | 131d934c6d1a |
hex | 981c9f27ca0 |
10453043543200 has 36 divisors (see below), whose sum is σ = 25518492551790. Its totient is φ = 4181217416960.
The previous prime is 10453043543191. The next prime is 10453043543233. The reversal of 10453043543200 is 234534035401.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 10213112073616 + 239931469584 = 3195796^2 + 489828^2 .
It is a super-2 number, since 2×104530435432002 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6533151415 + ... + 6533153014.
Almost surely, 210453043543200 is an apocalyptic number.
10453043543200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10453043543200 is an abundant number, since it is smaller than the sum of its proper divisors (15065449008590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10453043543200 is a wasteful number, since it uses less digits than its factorization.
10453043543200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13066304449 (or 13066304436 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 34.
Adding to 10453043543200 its reverse (234534035401), we get a palindrome (10687577578601).
The spelling of 10453043543200 in words is "ten trillion, four hundred fifty-three billion, forty-three million, five hundred forty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •