Base | Representation |
---|---|
bin | 10111011011000001011010… |
… | …010100110011111100001011 |
3 | 111111201212000011110110121010 |
4 | 113123001122110303330023 |
5 | 102000222044311013311 |
6 | 1003031021540215003 |
7 | 30461241443402322 |
oct | 2733013224637413 |
9 | 444655004413533 |
10 | 103012011032331 |
11 | 2a90616a78a255 |
12 | b67850209a463 |
13 | 4562cb61a106b |
14 | 1b61b44d990b9 |
15 | bd98a3712da6 |
hex | 5db05a533f0b |
103012011032331 has 16 divisors (see below), whose sum is σ = 137732827749120. Its totient is φ = 68482936644960.
The previous prime is 103012011032317. The next prime is 103012011032353. The reversal of 103012011032331 is 133230110210301.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-103012011032331 is a prime.
It is a super-2 number, since 2×1030120110323312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103012011032298 and 103012011032307.
It is not an unprimeable number, because it can be changed into a prime (103012011033331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 324428656 + ... + 324746018.
It is an arithmetic number, because the mean of its divisors is an integer number (8608301734320).
Almost surely, 2103012011032331 is an apocalyptic number.
103012011032331 is a deficient number, since it is larger than the sum of its proper divisors (34720816716789).
103012011032331 is a wasteful number, since it uses less digits than its factorization.
103012011032331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 619106.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 103012011032331 its reverse (133230110210301), we get a palindrome (236242121242632).
The spelling of 103012011032331 in words is "one hundred three trillion, twelve billion, eleven million, thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •