Base | Representation |
---|---|
bin | 10111011010111111101110… |
… | …100100001000111110001110 |
3 | 111111201200100011112120012022 |
4 | 113122333232210020332032 |
5 | 102000204343444030220 |
6 | 1003030122314210142 |
7 | 30461145601334465 |
oct | 2732775644107616 |
9 | 444650304476168 |
10 | 103010203111310 |
11 | 2a905422205450 |
12 | b678098723952 |
13 | 4562a88769801 |
14 | 1b61a12c1d9dc |
15 | bd97e9b42925 |
hex | 5dafee908f8e |
103010203111310 has 128 divisors (see below), whose sum is σ = 215106972171264. Its totient is φ = 35101308303360.
The previous prime is 103010203111279. The next prime is 103010203111337. The reversal of 103010203111310 is 13111302010301.
It is a super-2 number, since 2×1030102031113102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 647144252 + ... + 647303408.
It is an arithmetic number, because the mean of its divisors is an integer number (1680523220088).
Almost surely, 2103010203111310 is an apocalyptic number.
103010203111310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103010203111310 is an abundant number, since it is smaller than the sum of its proper divisors (112096769059954).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103010203111310 is a wasteful number, since it uses less digits than its factorization.
103010203111310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160698.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 103010203111310 its reverse (13111302010301), we get a palindrome (116121505121611).
The spelling of 103010203111310 in words is "one hundred three trillion, ten billion, two hundred three million, one hundred eleven thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •