Base | Representation |
---|---|
bin | 10111111110101001101001… |
… | …010010010100001100111001 |
3 | 111211101220201010211100221011 |
4 | 113332221221102110030321 |
5 | 102310330341202120001 |
6 | 1012143500315313521 |
7 | 31133155601165341 |
oct | 2776515122241471 |
9 | 454356633740834 |
10 | 105460393395001 |
11 | 3066a5577a7627 |
12 | b9b2b2044b8a1 |
13 | 46acb45943818 |
14 | 1c0844b575d21 |
15 | c2d400948d51 |
hex | 5fea69494339 |
105460393395001 has 8 divisors (see below), whose sum is σ = 105482061953408. Its totient is φ = 105438725676000.
The previous prime is 105460393394927. The next prime is 105460393395013. The reversal of 105460393395001 is 100593393064501.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105460393395001 - 211 = 105460393392953 is a prime.
It is a super-2 number, since 2×1054603933950012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105460493395001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 292447516 + ... + 292807906.
It is an arithmetic number, because the mean of its divisors is an integer number (13185257744176).
Almost surely, 2105460393395001 is an apocalyptic number.
It is an amenable number.
105460393395001 is a deficient number, since it is larger than the sum of its proper divisors (21668558407).
105460393395001 is an equidigital number, since it uses as much as digits as its factorization.
105460393395001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419703.
The product of its (nonzero) digits is 1312200, while the sum is 49.
The spelling of 105460393395001 in words is "one hundred five trillion, four hundred sixty billion, three hundred ninety-three million, three hundred ninety-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •