Base | Representation |
---|---|
bin | 11000001101000101000100… |
… | …100100110001100111111111 |
3 | 111221220200222222111202121222 |
4 | 120031011010210301213333 |
5 | 102423102010210004440 |
6 | 1014223200134543555 |
7 | 31264616455130552 |
oct | 3015050444614777 |
9 | 457820888452558 |
10 | 106451914922495 |
11 | 30a1200486164a |
12 | bb33116b07bbb |
13 | 47524ac51090c |
14 | 1c4042b964699 |
15 | c490d2ba02b5 |
hex | 60d1449319ff |
106451914922495 has 8 divisors (see below), whose sum is σ = 133296310859616. Its totient is φ = 81458856636256.
The previous prime is 106451914922467. The next prime is 106451914922513. The reversal of 106451914922495 is 594229419154601.
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 106451914922495 - 212 = 106451914918399 is a prime.
It is a super-2 number, since 2×1064519149224952 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 462834412592 + ... + 462834412821.
It is an arithmetic number, because the mean of its divisors is an integer number (16662038857452).
Almost surely, 2106451914922495 is an apocalyptic number.
106451914922495 is a deficient number, since it is larger than the sum of its proper divisors (26844395937121).
106451914922495 is an equidigital number, since it uses as much as digits as its factorization.
106451914922495 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 925668825441.
The product of its (nonzero) digits is 27993600, while the sum is 62.
The spelling of 106451914922495 in words is "one hundred six trillion, four hundred fifty-one billion, nine hundred fourteen million, nine hundred twenty-two thousand, four hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.202 sec. • engine limits •