Base | Representation |
---|---|
bin | 11000010000010001001101… |
… | …000101110001010001111000 |
3 | 111222200122202110000100111022 |
4 | 120100101031011301101320 |
5 | 102440144403341343111 |
6 | 1014512005523522012 |
7 | 31316506220105351 |
oct | 3020211505612170 |
9 | 458618673010438 |
10 | 106671101121656 |
11 | 30a96a61745195 |
12 | bb696a7b29308 |
13 | 476a070731c56 |
14 | 1c4aca1c0cd28 |
15 | c4eb606de2db |
hex | 61044d171478 |
106671101121656 has 32 divisors (see below), whose sum is σ = 203326267992480. Its totient is φ = 52457757360000.
The previous prime is 106671101121647. The next prime is 106671101121667. The reversal of 106671101121656 is 656121101176601.
106671101121656 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1066711011216562 (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 7 ways as a sum of consecutive naturals, for example, 437025971 + ... + 437269986.
It is an arithmetic number, because the mean of its divisors is an integer number (6353945874765).
Almost surely, 2106671101121656 is an apocalyptic number.
It is an amenable number.
106671101121656 is a deficient number, since it is larger than the sum of its proper divisors (96655166870824).
106671101121656 is a wasteful number, since it uses less digits than its factorization.
106671101121656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 874296215 (or 874296211 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 44.
Subtracting 106671101121656 from its reverse (656121101176601), we obtain a palindrome (549450000054945).
The spelling of 106671101121656 in words is "one hundred six trillion, six hundred seventy-one billion, one hundred one million, one hundred twenty-one thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •