Base | Representation |
---|---|
bin | 1001100110001110110010… |
… | …1110010001000011000101 |
3 | 1101100210121200102022222120 |
4 | 2121203230232101003011 |
5 | 2340342314233333110 |
6 | 34235413310520153 |
7 | 2136246405335652 |
oct | 231435456210305 |
9 | 41323550368876 |
10 | 10552411230405 |
11 | 33a9286047670 |
12 | 1225165206059 |
13 | 5b711b764565 |
14 | 286a4cdc6c29 |
15 | 13475be5e870 |
hex | 998ecb910c5 |
10552411230405 has 64 divisors (see below), whose sum is σ = 18896830571520. Its totient is φ = 4984149542400.
The previous prime is 10552411230359. The next prime is 10552411230457. The reversal of 10552411230405 is 50403211425501.
It is not a de Polignac number, because 10552411230405 - 223 = 10552402841797 is a prime.
It is a super-2 number, since 2×105524112304052 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 726865 + ... + 4651145.
It is an arithmetic number, because the mean of its divisors is an integer number (295262977680).
Almost surely, 210552411230405 is an apocalyptic number.
10552411230405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10552411230405 is a deficient number, since it is larger than the sum of its proper divisors (8344419341115).
10552411230405 is a wasteful number, since it uses less digits than its factorization.
10552411230405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3924722.
The product of its (nonzero) digits is 24000, while the sum is 33.
Adding to 10552411230405 its reverse (50403211425501), we get a palindrome (60955622655906).
The spelling of 10552411230405 in words is "ten trillion, five hundred fifty-two billion, four hundred eleven million, two hundred thirty thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •