Base | Representation |
---|---|
bin | 11011111110101… |
… | …111101110011000 |
3 | 1012201022200100022 |
4 | 123332233232120 |
5 | 1430133330430 |
6 | 114325330012 |
7 | 14430055013 |
oct | 3376575630 |
9 | 1181280308 |
10 | 469433240 |
11 | 220a8a161 |
12 | 111266908 |
13 | 76342163 |
14 | 464ba37a |
15 | 2b32b4e5 |
hex | 1bfafb98 |
469433240 has 64 divisors (see below), whose sum is σ = 1126742400. Its totient is φ = 175403008.
The previous prime is 469433221. The next prime is 469433267. The reversal of 469433240 is 42334964.
It is a self number, because there is not a number n which added to its sum of digits gives 469433240.
It is a congruent number.
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, 90641 + ... + 95679.
It is an arithmetic number, because the mean of its divisors is an integer number (17605350).
Almost surely, 2469433240 is an apocalyptic number.
469433240 is a gapful number since it is divisible by the number (40) 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 469433240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (563371200).
469433240 is an abundant number, since it is smaller than the sum of its proper divisors (657309160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
469433240 is a wasteful number, since it uses less digits than its factorization.
469433240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5204 (or 5200 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 35.
The square root of 469433240 is about 21666.4081010213. The cubic root of 469433240 is about 777.1853629150.
The spelling of 469433240 in words is "four hundred sixty-nine million, four hundred thirty-three thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •