Base | Representation |
---|---|
bin | 11001100111010000… |
… | …10010101110100000 |
3 | 1022111100010101012201 |
4 | 30303220102232200 |
5 | 211130240233433 |
6 | 10152301502544 |
7 | 664523304313 |
oct | 146350225640 |
9 | 38440111181 |
10 | 13751102368 |
11 | 5917158813 |
12 | 27b9271a54 |
13 | 13b1b94183 |
14 | 94640697a |
15 | 55736aa7d |
hex | 333a12ba0 |
13751102368 has 48 divisors (see below), whose sum is σ = 28324658880. Its totient is φ = 6559128576.
The previous prime is 13751102363. The next prime is 13751102377. The reversal of 13751102368 is 86320115731.
It is a super-3 number, since 3×137511023683 (a number of 31 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (13751102363) 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, 254296 + ... + 303592.
It is an arithmetic number, because the mean of its divisors is an integer number (590097060).
Almost surely, 213751102368 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13751102368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14162329440).
13751102368 is an abundant number, since it is smaller than the sum of its proper divisors (14573556512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13751102368 is a wasteful number, since it uses less digits than its factorization.
13751102368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49709 (or 49701 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 37.
The spelling of 13751102368 in words is "thirteen billion, seven hundred fifty-one million, one hundred two thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •