Base | Representation |
---|---|
bin | 1001001100101101101101… |
… | …1110001100110110011101 |
3 | 1022210220002111110200110211 |
4 | 2103023123132030312131 |
5 | 2311202020444021140 |
6 | 33302153521532421 |
7 | 2062500135144262 |
oct | 223133336146635 |
9 | 38726074420424 |
10 | 10114035142045 |
11 | 324a37a19006a |
12 | 1174201aa4111 |
13 | 58499862c433 |
14 | 26d7441b3269 |
15 | 1281514032ea |
hex | 932db78cd9d |
10114035142045 has 12 divisors (see below), whose sum is σ = 12809243401020. Its totient is φ = 7665374001024.
The previous prime is 10114035142037. The next prime is 10114035142109. The reversal of 10114035142045 is 54024153041101.
It can be written as a sum of positive squares in 2 ways, for example, as 7061253919204 + 3052781222841 = 2657302^2 + 1747221^2 .
It is not a de Polignac number, because 10114035142045 - 23 = 10114035142037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10114035141998 and 10114035142016.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2801669980 + ... + 2801673589.
It is an arithmetic number, because the mean of its divisors is an integer number (1067436950085).
Almost surely, 210114035142045 is an apocalyptic number.
It is an amenable number.
10114035142045 is a deficient number, since it is larger than the sum of its proper divisors (2695208258975).
10114035142045 is an equidigital number, since it uses as much as digits as its factorization.
10114035142045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5603343612 (or 5603343593 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 31.
Adding to 10114035142045 its reverse (54024153041101), we get a palindrome (64138188183146).
The spelling of 10114035142045 in words is "ten trillion, one hundred fourteen billion, thirty-five million, one hundred forty-two thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •