Base | Representation |
---|---|
bin | 11101011001010011000… |
… | …11110000010101011100 |
3 | 10120120000122120110011120 |
4 | 32230221203300111130 |
5 | 113022002211202221 |
6 | 2051554433050540 |
7 | 132654050023560 |
oct | 16545143602534 |
9 | 3516018513146 |
10 | 1010014553436 |
11 | 35a387980139 |
12 | 1438b79b6a50 |
13 | 74322cb02c5 |
14 | 36c564b76a0 |
15 | 1b415a4b5c6 |
hex | eb298f055c |
1010014553436 has 48 divisors (see below), whose sum is σ = 2711448499200. Its totient is φ = 286638834240.
The previous prime is 1010014553417. The next prime is 1010014553441. The reversal of 1010014553436 is 6343554100101.
It is a happy number.
1010014553436 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 a junction number, because it is equal to n+sod(n) for n = 1010014553397 and 1010014553406.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40336420 + ... + 40361451.
It is an arithmetic number, because the mean of its divisors is an integer number (56488510400).
Almost surely, 21010014553436 is an apocalyptic number.
It is an amenable number.
1010014553436 is an abundant number, since it is smaller than the sum of its proper divisors (1701433945764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010014553436 is a wasteful number, since it uses less digits than its factorization.
1010014553436 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80698034 (or 80698032 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 1010014553436 its reverse (6343554100101), we get a palindrome (7353568653537).
The spelling of 1010014553436 in words is "one trillion, ten billion, fourteen million, five hundred fifty-three thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •