Base | Representation |
---|---|
bin | 110111101110111101111010… |
… | …011110010011000111111110 |
3 | 1012010220020220112200210212212 |
4 | 313232331322132103013332 |
5 | 224112022013112004042 |
6 | 2225154345032100422 |
7 | 102426226260425552 |
oct | 6756757236230776 |
9 | 1163806815623785 |
10 | 245120133313022 |
11 | 71114956a94050 |
12 | 235a9b10834712 |
13 | a6a09636106b6 |
14 | 4475c407b1862 |
15 | 1d5120d018482 |
hex | deef7a7931fe |
245120133313022 has 8 divisors (see below), whose sum is σ = 401105672694072. Its totient is φ = 111418242415000.
The previous prime is 245120133313019. The next prime is 245120133313043. The reversal of 245120133313022 is 220313331021542.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 245120133313022.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5570912120729 + ... + 5570912120772.
It is an arithmetic number, because the mean of its divisors is an integer number (50138209086759).
Almost surely, 2245120133313022 is an apocalyptic number.
245120133313022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
245120133313022 is a deficient number, since it is larger than the sum of its proper divisors (155985539381050).
245120133313022 is a wasteful number, since it uses less digits than its factorization.
245120133313022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11141824241514.
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 245120133313022 its reverse (220313331021542), we get a palindrome (465433464334564).
The spelling of 245120133313022 in words is "two hundred forty-five trillion, one hundred twenty billion, one hundred thirty-three million, three hundred thirteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •