Base | Representation |
---|---|
bin | 1101100001000010… |
… | …0100111111011010 |
3 | 100100212010220022020 |
4 | 3120100210333122 |
5 | 24412311140344 |
6 | 1400005235310 |
7 | 155624253630 |
oct | 33020447732 |
9 | 10325126266 |
10 | 3628224474 |
11 | 15a2046826 |
12 | 853102b36 |
13 | 45a8b2bb4 |
14 | 265c19350 |
15 | 1637d9719 |
hex | d8424fda |
3628224474 has 16 divisors (see below), whose sum is σ = 8293084608. Its totient is φ = 1036635552.
The previous prime is 3628224461. The next prime is 3628224487. The reversal of 3628224474 is 4744228263.
3628224474 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (3628224461) and next prime (3628224487).
It is a Harshad number since it is a multiple of its sum of digits (42), and also a Moran number because the ratio is a prime number: 86386297 = 3628224474 / (3 + 6 + 2 + 8 + 2 + 2 + 4 + 4 + 7 + 4).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43193107 + ... + 43193190.
It is an arithmetic number, because the mean of its divisors is an integer number (518317788).
Almost surely, 23628224474 is an apocalyptic number.
3628224474 is an abundant number, since it is smaller than the sum of its proper divisors (4664860134).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3628224474 is a wasteful number, since it uses less digits than its factorization.
3628224474 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86386309.
The product of its digits is 516096, while the sum is 42.
The square root of 3628224474 is about 60234.7447408885. The cubic root of 3628224474 is about 1536.6137539847.
The spelling of 3628224474 in words is "three billion, six hundred twenty-eight million, two hundred twenty-four thousand, four hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •