Base | Representation |
---|---|
bin | 11010100101101010… |
… | …11110001010100110 |
3 | 1100211211021101122000 |
4 | 31102311132022212 |
5 | 213213302311130 |
6 | 10320243150130 |
7 | 1013511346461 |
oct | 152265361246 |
9 | 40754241560 |
10 | 14274650790 |
11 | 6065739464 |
12 | 2924675346 |
13 | 14664a283a |
14 | 995b6c2d8 |
15 | 5882d6260 |
hex | 352d5e2a6 |
14274650790 has 128 divisors (see below), whose sum is σ = 40118976000. Its totient is φ = 3601749888.
The previous prime is 14274650783. The next prime is 14274650807. The reversal of 14274650790 is 9705647241.
14274650790 is a `hidden beast` number, since 14 + 2 + 7 + 46 + 507 + 90 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6549921 + ... + 6552099.
It is an arithmetic number, because the mean of its divisors is an integer number (313429500).
Almost surely, 214274650790 is an apocalyptic number.
14274650790 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 14274650790, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20059488000).
14274650790 is an abundant number, since it is smaller than the sum of its proper divisors (25844325210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14274650790 is a wasteful number, since it uses less digits than its factorization.
14274650790 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3491 (or 3485 counting only the distinct ones).
The product of its (nonzero) digits is 423360, while the sum is 45.
The spelling of 14274650790 in words is "fourteen billion, two hundred seventy-four million, six hundred fifty thousand, seven hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •