Base | Representation |
---|---|
bin | 11001101110010001… |
… | …00101001001001110 |
3 | 1022122102202111202000 |
4 | 30313020211021032 |
5 | 211240313214222 |
6 | 10202202013130 |
7 | 666136124322 |
oct | 146710451116 |
9 | 38572674660 |
10 | 13809898062 |
11 | 59473668a4 |
12 | 2814aa71a6 |
13 | 13c110bc1c |
14 | 95014d982 |
15 | 55c5d19ac |
hex | 33722524e |
13809898062 has 128 divisors (see below), whose sum is σ = 32053432320. Its totient is φ = 4403911680.
The previous prime is 13809898061. The next prime is 13809898121. The reversal of 13809898062 is 26089890831.
It is a happy number.
It is a super-3 number, since 3×138098980623 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13809898061) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 40978758 + ... + 40979094.
It is an arithmetic number, because the mean of its divisors is an integer number (250417440).
Almost surely, 213809898062 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13809898062, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16026716160).
13809898062 is an abundant number, since it is smaller than the sum of its proper divisors (18243534258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13809898062 is a wasteful number, since it uses less digits than its factorization.
13809898062 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 695 (or 689 counting only the distinct ones).
The product of its (nonzero) digits is 1492992, while the sum is 54.
The spelling of 13809898062 in words is "thirteen billion, eight hundred nine million, eight hundred ninety-eight thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •