Base | Representation |
---|---|
bin | 1101011001111100000… |
… | …10001001010010000000 |
3 | 1122000220011101122221020 |
4 | 12230332002021102000 |
5 | 30021303134002433 |
6 | 551333040425440 |
7 | 45164103346461 |
oct | 6547602112200 |
9 | 1560804348836 |
10 | 460602250368 |
11 | 168381a65037 |
12 | 75326918280 |
13 | 34585aa14a0 |
14 | 18416a26d68 |
15 | beabe60cb3 |
hex | 6b3e089480 |
460602250368 has 128 divisors (see below), whose sum is σ = 1317863843520. Its totient is φ = 141694119936.
The previous prime is 460602250327. The next prime is 460602250397. The reversal of 460602250368 is 863052206064.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (128).
It is a super-2 number, since 2×4606022503682 (a number of 24 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43460046 + ... + 43470642.
Almost surely, 2460602250368 is an apocalyptic number.
460602250368 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 460602250368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (658931921760).
460602250368 is an abundant number, since it is smaller than the sum of its proper divisors (857261593152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
460602250368 is a wasteful number, since it uses less digits than its factorization.
460602250368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19334 (or 19322 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 42.
The spelling of 460602250368 in words is "four hundred sixty billion, six hundred two million, two hundred fifty thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •