Base | Representation |
---|---|
bin | 11011111010011… |
… | …000101011110111 |
3 | 1012122011121112000 |
4 | 123322120223313 |
5 | 1424340242140 |
6 | 114245030343 |
7 | 14414254554 |
oct | 3372305367 |
9 | 1178147460 |
10 | 468290295 |
11 | 220379480 |
12 | 1109b53b3 |
13 | 76031b65 |
14 | 4629da2b |
15 | 2b1a2a30 |
hex | 1be98af7 |
468290295 has 64 divisors (see below), whose sum is σ = 917844480. Its totient is φ = 224640000.
The previous prime is 468290293. The next prime is 468290311. The reversal of 468290295 is 592092864.
It is not a de Polignac number, because 468290295 - 21 = 468290293 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 468290295.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (468290293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 142420 + ... + 145670.
It is an arithmetic number, because the mean of its divisors is an integer number (14341320).
Almost surely, 2468290295 is an apocalyptic number.
468290295 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
468290295 is a deficient number, since it is larger than the sum of its proper divisors (449554185).
468290295 is a wasteful number, since it uses less digits than its factorization.
468290295 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3373 (or 3367 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 45.
The square root of 468290295 is about 21640.0160582196. The cubic root of 468290295 is about 776.5541038177.
The spelling of 468290295 in words is "four hundred sixty-eight million, two hundred ninety thousand, two hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •