Base | Representation |
---|---|
bin | 10111111110101001100101… |
… | …000100010111100101111100 |
3 | 111211101220112012200010121122 |
4 | 113332221211010113211330 |
5 | 102310330220043130022 |
6 | 1012143445310450112 |
7 | 31133154051534410 |
oct | 2776514504274574 |
9 | 454356465603548 |
10 | 105460322630012 |
11 | 3066a520863869 |
12 | b9b2b00803938 |
13 | 46acb34097a4c |
14 | 1c08441dd4d40 |
15 | c2d3e961b742 |
hex | 5fea6511797c |
105460322630012 has 12 divisors (see below), whose sum is σ = 210920645260080. Its totient is φ = 45197281127136.
The previous prime is 105460322629997. The next prime is 105460322630053. The reversal of 105460322630012 is 210036223064501.
105460322630012 is an admirable number.
It is a super-2 number, since 2×1054603226300122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1883220046937 + ... + 1883220046992.
It is an arithmetic number, because the mean of its divisors is an integer number (17576720438340).
Almost surely, 2105460322630012 is an apocalyptic number.
It is an amenable number.
105460322630012 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105460322630012 is a wasteful number, since it uses less digits than its factorization.
105460322630012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3766440093940 (or 3766440093938 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 35.
Adding to 105460322630012 its reverse (210036223064501), we get a palindrome (315496545694513).
The spelling of 105460322630012 in words is "one hundred five trillion, four hundred sixty billion, three hundred twenty-two million, six hundred thirty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •