Base | Representation |
---|---|
bin | 1100101111100000010000… |
… | …1011011111010000110010 |
3 | 1211121100220122120200021102 |
4 | 3023320010023133100302 |
5 | 3314020444340040200 |
6 | 45444115505524402 |
7 | 2644131066222560 |
oct | 313700413372062 |
9 | 54540818520242 |
10 | 14010253440050 |
11 | 451179590298a |
12 | 16a3345643702 |
13 | 7a82132b983a |
14 | 366158124a30 |
15 | 19468b16e6d5 |
hex | cbe042df432 |
14010253440050 has 96 divisors (see below), whose sum is σ = 30131359648128. Its totient is φ = 4747443217920.
The previous prime is 14010253440031. The next prime is 14010253440059. The reversal of 14010253440050 is 5004435201041.
It is a junction number, because it is equal to n+sod(n) for n = 14010253439995 and 14010253440022.
It is not an unprimeable number, because it can be changed into a prime (14010253440059) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10241072 + ... + 11528228.
It is an arithmetic number, because the mean of its divisors is an integer number (313868329668).
Almost surely, 214010253440050 is an apocalyptic number.
14010253440050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14010253440050 is an abundant number, since it is smaller than the sum of its proper divisors (16121106208078).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14010253440050 is a wasteful number, since it uses less digits than its factorization.
14010253440050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1287540 (or 1287535 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 29.
Adding to 14010253440050 its reverse (5004435201041), we get a palindrome (19014688641091).
The spelling of 14010253440050 in words is "fourteen trillion, ten billion, two hundred fifty-three million, four hundred forty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •