Base | Representation |
---|---|
bin | 110100010100011110101111… |
… | …1111101000000000000100110 |
3 | 2020100110210201012112002110002 |
4 | 1220220331133331000000212 |
5 | 440310101430020410123 |
6 | 4310442151423301302 |
7 | 165636123502066316 |
oct | 15050753775000046 |
9 | 2210423635462402 |
10 | 460211650560038 |
11 | 123701735059113 |
12 | 4374812674a832 |
13 | 169a3a07061900 |
14 | 81905114bb446 |
15 | 3831263d9d528 |
hex | 1a28f5ff40026 |
460211650560038 has 24 divisors (see below), whose sum is σ = 747512820574488. Its totient is φ = 212402739773952.
The previous prime is 460211650560037. The next prime is 460211650560119. The reversal of 460211650560038 is 830065056112064.
It is a super-2 number, since 2×4602116505600382 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 460211650559974 and 460211650560001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (460211650560037) 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 11 ways as a sum of consecutive naturals, for example, 18939206 + ... + 35764742.
It is an arithmetic number, because the mean of its divisors is an integer number (31146367523937).
Almost surely, 2460211650560038 is an apocalyptic number.
460211650560038 is a deficient number, since it is larger than the sum of its proper divisors (287301170014450).
460211650560038 is a wasteful number, since it uses less digits than its factorization.
460211650560038 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16906488 (or 16906475 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 47.
The spelling of 460211650560038 in words is "four hundred sixty trillion, two hundred eleven billion, six hundred fifty million, five hundred sixty thousand, thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •