Base | Representation |
---|---|
bin | 10111111000101111100010… |
… | …110011000100101111011110 |
3 | 111202222002210110200202201111 |
4 | 113320233202303010233132 |
5 | 102232202412443214241 |
6 | 1011233155121132234 |
7 | 31061634134326225 |
oct | 2770574263045736 |
9 | 452862713622644 |
10 | 105054410132446 |
11 | 30523363836545 |
12 | b9482b948a07a |
13 | 4680785849b48 |
14 | 1bd29368bdcbc |
15 | c22a8db21c81 |
hex | 5f8be2cc4bde |
105054410132446 has 8 divisors (see below), whose sum is σ = 161840577771720. Its totient is φ = 51107550875208.
The previous prime is 105054410132443. The next prime is 105054410132527. The reversal of 105054410132446 is 644231014450501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1050544101324462 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105054410132399 and 105054410132408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105054410132443) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 709827095416 + ... + 709827095563.
It is an arithmetic number, because the mean of its divisors is an integer number (20230072221465).
Almost surely, 2105054410132446 is an apocalyptic number.
105054410132446 is a deficient number, since it is larger than the sum of its proper divisors (56786167639274).
105054410132446 is a wasteful number, since it uses less digits than its factorization.
105054410132446 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1419654191018.
The product of its (nonzero) digits is 230400, while the sum is 40.
Adding to 105054410132446 its reverse (644231014450501), we get a palindrome (749285424582947).
The spelling of 105054410132446 in words is "one hundred five trillion, fifty-four billion, four hundred ten million, one hundred thirty-two thousand, four hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •