Base | Representation |
---|---|
bin | 101111100000110011… |
… | …0011100111001001001 |
3 | 100202100210211102022210 |
4 | 1133001212130321021 |
5 | 3132430234032223 |
6 | 114512322535333 |
7 | 10241312332524 |
oct | 1370146347111 |
9 | 322323742283 |
10 | 102032330313 |
11 | 3a2a9654a31 |
12 | 17936507549 |
13 | 9810896664 |
14 | 4d1cd33bbb |
15 | 29c2886893 |
hex | 17c199ce49 |
102032330313 has 16 divisors (see below), whose sum is σ = 142969255616. Its totient is φ = 64643987520.
The previous prime is 102032330299. The next prime is 102032330321. The reversal of 102032330313 is 313033230201.
It is not a de Polignac number, because 102032330313 - 24 = 102032330297 is a prime.
It is a super-2 number, since 2×1020323303132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102032330313.
It is not an unprimeable number, because it can be changed into a prime (102032330353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10683718 + ... + 10693263.
It is an arithmetic number, because the mean of its divisors is an integer number (8935578476).
Almost surely, 2102032330313 is an apocalyptic number.
It is an amenable number.
102032330313 is a deficient number, since it is larger than the sum of its proper divisors (40936925303).
102032330313 is a wasteful number, since it uses less digits than its factorization.
102032330313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21377064.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 102032330313 its reverse (313033230201), we get a palindrome (415065560514).
The spelling of 102032330313 in words is "one hundred two billion, thirty-two million, three hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •