Base | Representation |
---|---|
bin | 1101011010100100110001… |
… | …1000110010010000000000 |
3 | 1221020002211202011222200020 |
4 | 3112221030120302100000 |
5 | 3413131402002311120 |
6 | 51212051544453440 |
7 | 3051444455013210 |
oct | 326511430622000 |
9 | 57202752158606 |
10 | 14750199260160 |
11 | 4777584a44451 |
12 | 17a282ba7a280 |
13 | 82cc26519210 |
14 | 38dcb0732240 |
15 | 1a8a470aa640 |
hex | d6a4c632400 |
14750199260160 has 2112 divisors, whose sum is σ = 61194780057600. Its totient is φ = 2952222474240.
The previous prime is 14750199260113. The next prime is 14750199260197. The reversal of 14750199260160 is 6106299105741.
It is a happy number.
It is a super-2 number, since 2×147501992601602 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 106116541371 + ... + 106116541509.
Almost surely, 214750199260160 is an apocalyptic number.
14750199260160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14750199260160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30597390028800).
14750199260160 is an abundant number, since it is smaller than the sum of its proper divisors (46444580797440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14750199260160 is a wasteful number, since it uses less digits than its factorization.
14750199260160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 328 (or 279 counting only the distinct ones).
The product of its (nonzero) digits is 816480, while the sum is 51.
The spelling of 14750199260160 in words is "fourteen trillion, seven hundred fifty billion, one hundred ninety-nine million, two hundred sixty thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •