Base | Representation |
---|---|
bin | 11101100000110… |
… | …010111110000010 |
3 | 1021111200112210011 |
4 | 131200302332002 |
5 | 2003223333032 |
6 | 121044255134 |
7 | 15161410030 |
oct | 3540627602 |
9 | 1244615704 |
10 | 495136642 |
11 | 234545540 |
12 | 1199a14aa |
13 | 7b771580 |
14 | 49a8b550 |
15 | 2d707247 |
hex | 1d832f82 |
495136642 has 64 divisors (see below), whose sum is σ = 1006790400. Its totient is φ = 176359680.
The previous prime is 495136613. The next prime is 495136693. The reversal of 495136642 is 246631594.
It is a junction number, because it is equal to n+sod(n) for n = 495136595 and 495136604.
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, 217084 + ... + 219352.
It is an arithmetic number, because the mean of its divisors is an integer number (15731100).
Almost surely, 2495136642 is an apocalyptic number.
495136642 is an abundant number, since it is smaller than the sum of its proper divisors (511653758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
495136642 is a wasteful number, since it uses less digits than its factorization.
495136642 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2411.
The product of its digits is 155520, while the sum is 40.
The square root of 495136642 is about 22251.6660499838. Note that the first 3 decimals coincide. The cubic root of 495136642 is about 791.1187706002.
The spelling of 495136642 in words is "four hundred ninety-five million, one hundred thirty-six thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •