Base | Representation |
---|---|
bin | 10111101111010001101… |
… | …011101000111011010001 |
3 | 12202221200211110211021110 |
4 | 113233101223220323101 |
5 | 203211410440430103 |
6 | 3245225205043533 |
7 | 225600252214341 |
oct | 27572153507321 |
9 | 5687624424243 |
10 | 1631310483153 |
11 | 57992026a94a |
12 | 2241aa6b65a9 |
13 | baaa7956850 |
14 | 58d54bc4d21 |
15 | 2c67a2be403 |
hex | 17bd1ae8ed1 |
1631310483153 has 16 divisors (see below), whose sum is σ = 2377355656256. Its totient is φ = 988900038720.
The previous prime is 1631310483107. The next prime is 1631310483161. The reversal of 1631310483153 is 3513840131361.
It is a de Polignac number, because none of the positive numbers 2k-1631310483153 is a prime.
It is a super-2 number, since 2×16313104831532 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1631310483053) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 312150178 + ... + 312155403.
It is an arithmetic number, because the mean of its divisors is an integer number (148584728516).
Almost surely, 21631310483153 is an apocalyptic number.
1631310483153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1631310483153 is a deficient number, since it is larger than the sum of its proper divisors (746045173103).
1631310483153 is a wasteful number, since it uses less digits than its factorization.
1631310483153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 624305664.
The product of its (nonzero) digits is 77760, while the sum is 39.
The spelling of 1631310483153 in words is "one trillion, six hundred thirty-one billion, three hundred ten million, four hundred eighty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •