Base | Representation |
---|---|
bin | 11011110110110101… |
… | …01110011011001001 |
3 | 1102121021102101111200 |
4 | 31323122232123021 |
5 | 221112102132403 |
6 | 10512004214413 |
7 | 1036416461265 |
oct | 157332563311 |
9 | 42537371450 |
10 | 14955505353 |
11 | 6384aa1588 |
12 | 2a9469a409 |
13 | 154456a769 |
14 | a1c3610a5 |
15 | 5c7e75ca3 |
hex | 37b6ae6c9 |
14955505353 has 24 divisors (see below), whose sum is σ = 23047760736. Its totient is φ = 9312201600.
The previous prime is 14955505297. The next prime is 14955505381. The reversal of 14955505353 is 35350555941.
14955505353 is a `hidden beast` number, since 1 + 4 + 95 + 5 + 505 + 3 + 53 = 666.
It is not a de Polignac number, because 14955505353 - 29 = 14955504841 is a prime.
It is a super-2 number, since 2×149555053532 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 14955505299 and 14955505308.
It is not an unprimeable number, because it can be changed into a prime (14955505153) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 353043 + ... + 393128.
It is an arithmetic number, because the mean of its divisors is an integer number (960323364).
Almost surely, 214955505353 is an apocalyptic number.
It is an amenable number.
14955505353 is a deficient number, since it is larger than the sum of its proper divisors (8092255383).
14955505353 is a wasteful number, since it uses less digits than its factorization.
14955505353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 746325 (or 746322 counting only the distinct ones).
The product of its (nonzero) digits is 1012500, while the sum is 45.
The spelling of 14955505353 in words is "fourteen billion, nine hundred fifty-five million, five hundred five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •