Base | Representation |
---|---|
bin | 11010001000011110… |
… | …10110010000011111 |
3 | 1100012202111110102202 |
4 | 31010033112100133 |
5 | 212213110312103 |
6 | 10240054442115 |
7 | 1004446061513 |
oct | 150417262037 |
9 | 40182443382 |
10 | 14029775903 |
11 | 5a4a496320 |
12 | 287666333b |
13 | 1427835b60 |
14 | 971428143 |
15 | 571a65988 |
hex | 3443d641f |
14029775903 has 32 divisors (see below), whose sum is σ = 16738892352. Its totient is φ = 11590732800.
The previous prime is 14029775863. The next prime is 14029775953. The reversal of 14029775903 is 30957792041.
14029775903 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 14029775903 - 212 = 14029771807 is a prime.
It is a super-2 number, since 2×140297759032 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14029775953) 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 31 ways as a sum of consecutive naturals, for example, 8569601 + ... + 8571237.
It is an arithmetic number, because the mean of its divisors is an integer number (523090386).
Almost surely, 214029775903 is an apocalyptic number.
14029775903 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
14029775903 is a deficient number, since it is larger than the sum of its proper divisors (2709116449).
14029775903 is a wasteful number, since it uses less digits than its factorization.
14029775903 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2555.
The product of its (nonzero) digits is 476280, while the sum is 47.
The spelling of 14029775903 in words is "fourteen billion, twenty-nine million, seven hundred seventy-five thousand, nine hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •