Base | Representation |
---|---|
bin | 110010101100100001101… |
… | …101011010100010010001 |
3 | 110100001020220021101020020 |
4 | 302230201231122202101 |
5 | 424034242202432403 |
6 | 11224232302134053 |
7 | 506460262444134 |
oct | 62544155324221 |
9 | 13301226241206 |
10 | 3483784030353 |
11 | 1123512299170 |
12 | 483220281329 |
13 | 1c369a238663 |
14 | c088a60a21b |
15 | 6094b920453 |
hex | 32b21b5a891 |
3483784030353 has 16 divisors (see below), whose sum is σ = 5074469400000. Its totient is φ = 2108406271680.
The previous prime is 3483784030333. The next prime is 3483784030361. The reversal of 3483784030353 is 3530304873843.
It is not a de Polignac number, because 3483784030353 - 218 = 3483783768209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3483784030296 and 3483784030305.
It is not an unprimeable number, because it can be changed into a prime (3483784030333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 74425978 + ... + 74472771.
It is an arithmetic number, because the mean of its divisors is an integer number (317154337500).
Almost surely, 23483784030353 is an apocalyptic number.
3483784030353 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
3483784030353 is a deficient number, since it is larger than the sum of its proper divisors (1590685369647).
3483784030353 is a wasteful number, since it uses less digits than its factorization.
3483784030353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148899472.
The product of its (nonzero) digits is 8709120, while the sum is 51.
The spelling of 3483784030353 in words is "three trillion, four hundred eighty-three billion, seven hundred eighty-four million, thirty thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •