Base | Representation |
---|---|
bin | 10111111011000101011011… |
… | …001010000011101101110110 |
3 | 111210112111012011200100012101 |
4 | 113323011123022003231312 |
5 | 102242322010330312210 |
6 | 1011435132243412314 |
7 | 31106362201051162 |
oct | 2773053312035566 |
9 | 453474164610171 |
10 | 105215343213430 |
11 | 3058563831620a |
12 | b97353168409a |
13 | 46929c21c3598 |
14 | 1bda6422c1ca2 |
15 | c26d5c472a3a |
hex | 5fb15b283b76 |
105215343213430 has 64 divisors (see below), whose sum is σ = 194878027008000. Its totient is φ = 40880340549504.
The previous prime is 105215343213397. The next prime is 105215343213473. The reversal of 105215343213430 is 34312343512501.
It is a happy number.
It is a super-2 number, since 2×1052153432134302 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105215343213430.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 49426696 + ... + 51511444.
It is an arithmetic number, because the mean of its divisors is an integer number (3044969172000).
Almost surely, 2105215343213430 is an apocalyptic number.
105215343213430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105215343213430 is a deficient number, since it is larger than the sum of its proper divisors (89662683794570).
105215343213430 is a wasteful number, since it uses less digits than its factorization.
105215343213430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2085613.
The product of its (nonzero) digits is 129600, while the sum is 37.
Adding to 105215343213430 its reverse (34312343512501), we get a palindrome (139527686725931).
The spelling of 105215343213430 in words is "one hundred five trillion, two hundred fifteen billion, three hundred forty-three million, two hundred thirteen thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •