Base | Representation |
---|---|
bin | 11100010111010… |
… | …110011010000110 |
3 | 1020011110100221120 |
4 | 130113112122012 |
5 | 1433311230032 |
6 | 115115454410 |
7 | 14535640260 |
oct | 3427263206 |
9 | 1204410846 |
10 | 475883142 |
11 | 224695059 |
12 | 113457406 |
13 | 7778cb77 |
14 | 472b8b30 |
15 | 2bba262c |
hex | 1c5d6686 |
475883142 has 64 divisors (see below), whose sum is σ = 1162667520. Its totient is φ = 126752256.
The previous prime is 475883119. The next prime is 475883153. The reversal of 475883142 is 241388574.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 475883094 and 475883103.
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, 73284 + ... + 79512.
It is an arithmetic number, because the mean of its divisors is an integer number (18166680).
Almost surely, 2475883142 is an apocalyptic number.
475883142 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 475883142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (581333760).
475883142 is an abundant number, since it is smaller than the sum of its proper divisors (686784378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
475883142 is a wasteful number, since it uses less digits than its factorization.
475883142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6365.
The product of its digits is 215040, while the sum is 42.
The square root of 475883142 is about 21814.7459760594. The cubic root of 475883142 is about 780.7286320930.
The spelling of 475883142 in words is "four hundred seventy-five million, eight hundred eighty-three thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •