Base | Representation |
---|---|
bin | 11000001101000110001101… |
… | …111101111010110000000000 |
3 | 111221220211011210110200202021 |
4 | 120031012031331322300000 |
5 | 102423112020420001430 |
6 | 1014223522242331224 |
7 | 31264662126214426 |
oct | 3015061575726000 |
9 | 457824153420667 |
10 | 106453146250240 |
11 | 30a12586915389 |
12 | bb333bb359b14 |
13 | 475264765350a |
14 | 1c405072cb116 |
15 | c49155d2807a |
hex | 60d18df7ac00 |
106453146250240 has 88 divisors (see below), whose sum is σ = 264168415423440. Its totient is φ = 41112939184128.
The previous prime is 106453146250189. The next prime is 106453146250247. The reversal of 106453146250240 is 42052641354601.
It is a super-2 number, since 2×1064531462502402 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106453146250247) 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, 358327902 + ... + 358624861.
It is an arithmetic number, because the mean of its divisors is an integer number (3001913811630).
Almost surely, 2106453146250240 is an apocalyptic number.
106453146250240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106453146250240 is an abundant number, since it is smaller than the sum of its proper divisors (157715269173200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106453146250240 is an equidigital number, since it uses as much as digits as its factorization.
106453146250240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 716952817 (or 716952799 counting only the distinct ones).
The product of its (nonzero) digits is 691200, while the sum is 43.
The spelling of 106453146250240 in words is "one hundred six trillion, four hundred fifty-three billion, one hundred forty-six million, two hundred fifty thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •