Base | Representation |
---|---|
bin | 101100001010000… |
… | …1100101101011110 |
3 | 10211021001122111120 |
4 | 1120110030231132 |
5 | 11013303034300 |
6 | 403005431410 |
7 | 51501104526 |
oct | 13024145536 |
9 | 3737048446 |
10 | 1481689950 |
11 | 6a0414654 |
12 | 35426b566 |
13 | 1a7c81120 |
14 | 100ad8686 |
15 | 8a12e3a0 |
hex | 5850cb5e |
1481689950 has 192 divisors, whose sum is σ = 4138401792. Its totient is φ = 348364800.
The previous prime is 1481689921. The next prime is 1481689973. The reversal of 1481689950 is 599861841.
It is a junction number, because it is equal to n+sod(n) for n = 1481689893 and 1481689902.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 7677054 + ... + 7677246.
It is an arithmetic number, because the mean of its divisors is an integer number (21554176).
Almost surely, 21481689950 is an apocalyptic number.
1481689950 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 1481689950, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2069200896).
1481689950 is an abundant number, since it is smaller than the sum of its proper divisors (2656711842).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1481689950 is a wasteful number, since it uses less digits than its factorization.
1481689950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379 (or 374 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 51.
The square root of 1481689950 is about 38492.7259362077. The cubic root of 1481689950 is about 1140.0374333661.
The spelling of 1481689950 in words is "one billion, four hundred eighty-one million, six hundred eighty-nine thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •