Base | Representation |
---|---|
bin | 1001001000100010111110… |
… | …0010101000010001011010 |
3 | 1022120001021021220202101010 |
4 | 2102020233202220101122 |
5 | 2304013344333120200 |
6 | 33205232411434350 |
7 | 2054353543206453 |
oct | 222105742502132 |
9 | 38501237822333 |
10 | 10042431145050 |
11 | 3221a75637347 |
12 | 1162359a559b6 |
13 | 57acc6aac945 |
14 | 26a0b054612a |
15 | 1263600a4150 |
hex | 9222f8a845a |
10042431145050 has 48 divisors (see below), whose sum is σ = 25484420633760. Its totient is φ = 2615702994240.
The previous prime is 10042431144953. The next prime is 10042431145073. The reversal of 10042431145050 is 5054113424001.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 10042431144999 and 10042431145017.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 778476585 + ... + 778489484.
It is an arithmetic number, because the mean of its divisors is an integer number (530925429870).
Almost surely, 210042431145050 is an apocalyptic number.
10042431145050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10042431145050 is an abundant number, since it is smaller than the sum of its proper divisors (15441989488710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10042431145050 is a wasteful number, since it uses less digits than its factorization.
10042431145050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1556966127 (or 1556966122 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 10042431145050 its reverse (5054113424001), we get a palindrome (15096544569051).
The spelling of 10042431145050 in words is "ten trillion, forty-two billion, four hundred thirty-one million, one hundred forty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •