Base | Representation |
---|---|
bin | 11011000101001001… |
… | …10100101011010011 |
3 | 1101112020011121020022 |
4 | 31202210310223103 |
5 | 214233403101003 |
6 | 10402355134055 |
7 | 1023166045421 |
oct | 154244645323 |
9 | 41466147208 |
10 | 14538722003 |
11 | 6190803033 |
12 | 2998ba432b |
13 | 14a9100bb0 |
14 | 9bcc6c111 |
15 | 5a1599738 |
hex | 362934ad3 |
14538722003 has 16 divisors (see below), whose sum is σ = 16101439200. Its totient is φ = 13044599040.
The previous prime is 14538721991. The next prime is 14538722053. The reversal of 14538722003 is 30022783541.
14538722003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 14538722003 - 24 = 14538721987 is a prime.
It is a super-2 number, since 2×145387220032 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14538722053) 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, 38228 + ... + 174753.
It is an arithmetic number, because the mean of its divisors is an integer number (1006339950).
Almost surely, 214538722003 is an apocalyptic number.
14538722003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
14538722003 is a deficient number, since it is larger than the sum of its proper divisors (1562717197).
14538722003 is a wasteful number, since it uses less digits than its factorization.
14538722003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213142.
The product of its (nonzero) digits is 40320, while the sum is 35.
The spelling of 14538722003 in words is "fourteen billion, five hundred thirty-eight million, seven hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •