Base | Representation |
---|---|
bin | 1001010001100111110001… |
… | …1100010011111010100010 |
3 | 1100002221200212020011220110 |
4 | 2110121330130103322202 |
5 | 2314042200040011330 |
6 | 33405015222552150 |
7 | 2101543243020201 |
oct | 224317434237242 |
9 | 40087625204813 |
10 | 10198340157090 |
11 | 328210116a718 |
12 | 118860b598656 |
13 | 58c91261b317 |
14 | 2738609bd238 |
15 | 12a4377e6db0 |
hex | 9467c713ea2 |
10198340157090 has 64 divisors (see below), whose sum is σ = 25827221577600. Its totient is φ = 2570123395584.
The previous prime is 10198340157013. The next prime is 10198340157097. The reversal of 10198340157090 is 9075104389101.
10198340157090 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×101983401570902 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10198340157097) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21639517 + ... + 22105776.
It is an arithmetic number, because the mean of its divisors is an integer number (403550337150).
Almost surely, 210198340157090 is an apocalyptic number.
10198340157090 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10198340157090 is an abundant number, since it is smaller than the sum of its proper divisors (15628881420510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10198340157090 is a wasteful number, since it uses less digits than its factorization.
10198340157090 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43745731.
The product of its (nonzero) digits is 272160, while the sum is 48.
The spelling of 10198340157090 in words is "ten trillion, one hundred ninety-eight billion, three hundred forty million, one hundred fifty-seven thousand, ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •