Base | Representation |
---|---|
bin | 11011100101111000… |
… | …11110000000001101 |
3 | 1102020100221110022111 |
4 | 31302330132000031 |
5 | 220314204343140 |
6 | 10445525344021 |
7 | 1033042306645 |
oct | 156274360015 |
9 | 42210843274 |
10 | 14813356045 |
11 | 6311831714 |
12 | 2a54b68011 |
13 | 1520c8a047 |
14 | a0751b525 |
15 | 5ba7477ea |
hex | 372f1e00d |
14813356045 has 16 divisors (see below), whose sum is σ = 19428830208. Its totient is φ = 10793790720.
The previous prime is 14813356043. The next prime is 14813356087. The reversal of 14813356045 is 54065331841.
14813356045 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14813356045 - 21 = 14813356043 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14813355989 and 14813356007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14813356043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2808249 + ... + 2813518.
It is an arithmetic number, because the mean of its divisors is an integer number (1214301888).
Almost surely, 214813356045 is an apocalyptic number.
It is an amenable number.
14813356045 is a deficient number, since it is larger than the sum of its proper divisors (4615474163).
14813356045 is a wasteful number, since it uses less digits than its factorization.
14813356045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5621820.
The product of its (nonzero) digits is 172800, while the sum is 40.
Adding to 14813356045 its reverse (54065331841), we get a palindrome (68878687886).
The spelling of 14813356045 in words is "fourteen billion, eight hundred thirteen million, three hundred fifty-six thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •