Base | Representation |
---|---|
bin | 11011011100011… |
… | …101001001000110 |
3 | 1012002101222202000 |
4 | 123130131021012 |
5 | 1420333203410 |
6 | 113404530130 |
7 | 14260466001 |
oct | 3334351106 |
9 | 1162358660 |
10 | 460444230 |
11 | 2169aa624 |
12 | 10a250946 |
13 | 7451580c |
14 | 4521a538 |
15 | 2a652dc0 |
hex | 1b71d246 |
460444230 has 64 divisors (see below), whose sum is σ = 1245196800. Its totient is φ = 121050720.
The previous prime is 460444213. The next prime is 460444241. The reversal of 460444230 is 32444064.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 460444194 and 460444203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7161 + ... + 31179.
It is an arithmetic number, because the mean of its divisors is an integer number (19456200).
Almost surely, 2460444230 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 460444230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (622598400).
460444230 is an abundant number, since it is smaller than the sum of its proper divisors (784752570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
460444230 is a wasteful number, since it uses less digits than its factorization.
460444230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24106 (or 24100 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 27.
The square root of 460444230 is about 21457.9642557257. The cubic root of 460444230 is about 772.1926763209.
Adding to 460444230 its reverse (32444064), we get a palindrome (492888294).
The spelling of 460444230 in words is "four hundred sixty million, four hundred forty-four thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •