Base | Representation |
---|---|
bin | 10111100000001010011101… |
… | …111010111011100100111110 |
3 | 111112222121222201222110221210 |
4 | 113200022131322323210332 |
5 | 102022014200044314310 |
6 | 1003501213403505250 |
7 | 30525620203536321 |
oct | 2740123572734476 |
9 | 445877881873853 |
10 | 103365332416830 |
11 | 2aa31a9a469970 |
12 | b714a88828226 |
13 | 458a402bcb353 |
14 | 1b74ca19b27b8 |
15 | be3b82140820 |
hex | 5e029debb93e |
103365332416830 has 64 divisors (see below), whose sum is σ = 271254244117248. Its totient is φ = 25000391093760.
The previous prime is 103365332416817. The next prime is 103365332416837. The reversal of 103365332416830 is 38614233563301.
It is a self number, because there is not a number n which added to its sum of digits gives 103365332416830.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103365332416837) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 361552584 + ... + 361838363.
It is an arithmetic number, because the mean of its divisors is an integer number (4238347564332).
Almost surely, 2103365332416830 is an apocalyptic number.
103365332416830 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103365332416830 is an abundant number, since it is smaller than the sum of its proper divisors (167888911700418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103365332416830 is a wasteful number, since it uses less digits than its factorization.
103365332416830 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 723391401.
The product of its (nonzero) digits is 2799360, while the sum is 48.
The spelling of 103365332416830 in words is "one hundred three trillion, three hundred sixty-five billion, three hundred thirty-two million, four hundred sixteen thousand, eight hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •