Base | Representation |
---|---|
bin | 1001010100001111010100… |
… | …1000000000010100100100 |
3 | 1100021020210012111001201022 |
4 | 2111003311020000110210 |
5 | 2320311302011100202 |
6 | 33441414100150312 |
7 | 2105024612034323 |
oct | 225036510002444 |
9 | 40236705431638 |
10 | 10243314550052 |
11 | 329a190025821 |
12 | 1195281398398 |
13 | 593c2c134b6c |
14 | 275ac9aa40ba |
15 | 12b6bad77ea2 |
hex | 950f5200524 |
10243314550052 has 6 divisors (see below), whose sum is σ = 17925800462598. Its totient is φ = 5121657275024.
The previous prime is 10243314550043. The next prime is 10243314550061. The reversal of 10243314550052 is 25005541334201.
It is an interprime number because it is at equal distance from previous prime (10243314550043) and next prime (10243314550061).
It can be written as a sum of positive squares in only one way, i.e., 8349013765156 + 1894300784896 = 2889466^2 + 1376336^2 .
It is a junction number, because it is equal to n+sod(n) for n = 10243314549994 and 10243314550021.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1280414318753 + ... + 1280414318760.
It is an arithmetic number, because the mean of its divisors is an integer number (2987633410433).
Almost surely, 210243314550052 is an apocalyptic number.
It is an amenable number.
10243314550052 is a deficient number, since it is larger than the sum of its proper divisors (7682485912546).
10243314550052 is a wasteful number, since it uses less digits than its factorization.
10243314550052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2560828637517 (or 2560828637515 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 35.
Adding to 10243314550052 its reverse (25005541334201), we get a palindrome (35248855884253).
The spelling of 10243314550052 in words is "ten trillion, two hundred forty-three billion, three hundred fourteen million, five hundred fifty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •