Base | Representation |
---|---|
bin | 100001101010010110111… |
… | …101100101110101011001 |
3 | 22012010211122012021010210 |
4 | 201222112331211311121 |
5 | 300344441113232101 |
6 | 4530403030401333 |
7 | 326060606131560 |
oct | 41522675456531 |
9 | 8163748167123 |
10 | 2313225133401 |
11 | 8120403115a6 |
12 | 31439a500249 |
13 | 13a1a02abab0 |
14 | 7dd64202bd7 |
15 | 4028b75e7d6 |
hex | 21a96f65d59 |
2313225133401 has 64 divisors (see below), whose sum is σ = 3815529353216. Its totient is φ = 1213909804800.
The previous prime is 2313225133399. The next prime is 2313225133403. The reversal of 2313225133401 is 1043315223132.
It is an interprime number because it is at equal distance from previous prime (2313225133399) and next prime (2313225133403).
It is not a de Polignac number, because 2313225133401 - 21 = 2313225133399 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2313225133403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 188413275 + ... + 188425551.
It is an arithmetic number, because the mean of its divisors is an integer number (59617646144).
Almost surely, 22313225133401 is an apocalyptic number.
2313225133401 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2313225133401 is a deficient number, since it is larger than the sum of its proper divisors (1502304219815).
2313225133401 is a wasteful number, since it uses less digits than its factorization.
2313225133401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15782.
The product of its (nonzero) digits is 12960, while the sum is 30.
The spelling of 2313225133401 in words is "two trillion, three hundred thirteen billion, two hundred twenty-five million, one hundred thirty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •