Base | Representation |
---|---|
bin | 1100110101010011111101… |
… | …1101101011101011000110 |
3 | 1211221220110102010121021111 |
4 | 3031110333131223223012 |
5 | 3322134321233004110 |
6 | 50002020453235234 |
7 | 2654262516522103 |
oct | 315247735535306 |
9 | 54856412117244 |
10 | 14110032313030 |
11 | 4550038435a85 |
12 | 16ba751332b1a |
13 | 7b4755055894 |
14 | 36ad01a63aaa |
15 | 19707ac79e8a |
hex | cd53f76bac6 |
14110032313030 has 16 divisors (see below), whose sum is σ = 25538378930064. Its totient is φ = 5612830532640.
The previous prime is 14110032312947. The next prime is 14110032313031. The reversal of 14110032313030 is 3031323001141.
It is a junction number, because it is equal to n+sod(n) for n = 14110032312992 and 14110032313010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14110032313031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3897797172 + ... + 3897800791.
It is an arithmetic number, because the mean of its divisors is an integer number (1596148683129).
Almost surely, 214110032313030 is an apocalyptic number.
14110032313030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14110032313030 is a deficient number, since it is larger than the sum of its proper divisors (11428346617034).
14110032313030 is a wasteful number, since it uses less digits than its factorization.
14110032313030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7795598151.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 14110032313030 its reverse (3031323001141), we get a palindrome (17141355314171).
The spelling of 14110032313030 in words is "fourteen trillion, one hundred ten billion, thirty-two million, three hundred thirteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •