Base | Representation |
---|---|
bin | 11000001100110011001001… |
… | …010110001110011001000011 |
3 | 111221211212022121100120121121 |
4 | 120030303021112032121003 |
5 | 102422243100404011121 |
6 | 1014210254214533111 |
7 | 31263335503005466 |
oct | 3014631126163103 |
9 | 457755277316547 |
10 | 106432667641411 |
11 | 30a0492820a481 |
12 | bb2b445067197 |
13 | 4750732a731b7 |
14 | 1c3d52361b2dd |
15 | c4885806c141 |
hex | 60ccc958e643 |
106432667641411 has 24 divisors (see below), whose sum is σ = 114223187280384. Its totient is φ = 98984018818080.
The previous prime is 106432667641361. The next prime is 106432667641423. The reversal of 106432667641411 is 114146766234601.
It is not a de Polignac number, because 106432667641411 - 215 = 106432667608643 is a prime.
It is a super-2 number, since 2×1064326676414112 (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 (106432667641711) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 43618296 + ... + 45993706.
It is an arithmetic number, because the mean of its divisors is an integer number (4759299470016).
Almost surely, 2106432667641411 is an apocalyptic number.
106432667641411 is a deficient number, since it is larger than the sum of its proper divisors (7790519638973).
106432667641411 is a wasteful number, since it uses less digits than its factorization.
106432667641411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2376931 (or 2376894 counting only the distinct ones).
The product of its (nonzero) digits is 3483648, while the sum is 52.
The spelling of 106432667641411 in words is "one hundred six trillion, four hundred thirty-two billion, six hundred sixty-seven million, six hundred forty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.271 sec. • engine limits •