Base | Representation |
---|---|
bin | 10111011011001010101110… |
… | …111010000110111101101000 |
3 | 111111202210211201011020122001 |
4 | 113123022232322012331220 |
5 | 102000403044111432222 |
6 | 1003035355043540344 |
7 | 30462044460441415 |
oct | 2733125672067550 |
9 | 444683751136561 |
10 | 103022020030312 |
11 | 2a90a43658a609 |
12 | b67a43608a6b4 |
13 | 4563c1c9bbc86 |
14 | 1b624143c110c |
15 | bd9c8c29be27 |
hex | 5db2aee86f68 |
103022020030312 has 8 divisors (see below), whose sum is σ = 193166287556850. Its totient is φ = 51511010015152.
The previous prime is 103022020030271. The next prime is 103022020030339. The reversal of 103022020030312 is 213030020220301.
It can be written as a sum of positive squares in only one way, i.e., 89952970797316 + 13069049232996 = 9484354^2 + 3615114^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×1030220200303122 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103022020030312.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6438876251887 + ... + 6438876251902.
Almost surely, 2103022020030312 is an apocalyptic number.
It is an amenable number.
103022020030312 is a deficient number, since it is larger than the sum of its proper divisors (90144267526538).
103022020030312 is a wasteful number, since it uses less digits than its factorization.
103022020030312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12877752503795 (or 12877752503791 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 103022020030312 its reverse (213030020220301), we get a palindrome (316052040250613).
The spelling of 103022020030312 in words is "one hundred three trillion, twenty-two billion, twenty million, thirty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.240 sec. • engine limits •