Base | Representation |
---|---|
bin | 10111111101111101101101… |
… | …001111000111100011111110 |
3 | 111211020101221012101212120010 |
4 | 113331331231033013203332 |
5 | 102304042231021303111 |
6 | 1012110055031204050 |
7 | 31126565510520321 |
oct | 2775755517074376 |
9 | 454211835355503 |
10 | 105413215025406 |
11 | 30651547846232 |
12 | b9a5954516626 |
13 | 46a85676355b2 |
14 | 1c0605389a7b8 |
15 | c2c08db62aa6 |
hex | 5fdf6d3c78fe |
105413215025406 has 32 divisors (see below), whose sum is σ = 210907340328960. Its totient is φ = 35124254293536.
The previous prime is 105413215025329. The next prime is 105413215025413. The reversal of 105413215025406 is 604520512314501.
It is a super-2 number, since 2×1054132150254062 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 480967915 + ... + 481187033.
It is an arithmetic number, because the mean of its divisors is an integer number (6590854385280).
Almost surely, 2105413215025406 is an apocalyptic number.
105413215025406 is an abundant number, since it is smaller than the sum of its proper divisors (105494125303554).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105413215025406 is a wasteful number, since it uses less digits than its factorization.
105413215025406 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 249528.
The product of its (nonzero) digits is 144000, while the sum is 39.
Adding to 105413215025406 its reverse (604520512314501), we get a palindrome (709933727339907).
The spelling of 105413215025406 in words is "one hundred five trillion, four hundred thirteen billion, two hundred fifteen million, twenty-five thousand, four hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •