Base | Representation |
---|---|
bin | 10111011011001001111111… |
… | …111000100111110001000001 |
3 | 111111202201210201200000002220 |
4 | 113123021333320213301001 |
5 | 102000344440131024413 |
6 | 1003035144502401253 |
7 | 30462016100645661 |
oct | 2733117770476101 |
9 | 444681721600086 |
10 | 103021231111233 |
11 | 2a90a071227a76 |
12 | b67a255a30229 |
13 | 4563b25418956 |
14 | 1b6237b6dc1a1 |
15 | bd9c42db3223 |
hex | 5db27fe27c41 |
103021231111233 has 8 divisors (see below), whose sum is σ = 137363447299200. Its totient is φ = 68679917832048.
The previous prime is 103021231111217. The next prime is 103021231111301. The reversal of 103021231111233 is 332111132120301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103021231111233 - 24 = 103021231111217 is a prime.
It is a super-2 number, since 2×1030212311112332 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103021231111333) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 225460918 + ... + 225917391.
It is an arithmetic number, because the mean of its divisors is an integer number (17170430912400).
Almost surely, 2103021231111233 is an apocalyptic number.
It is an amenable number.
103021231111233 is a deficient number, since it is larger than the sum of its proper divisors (34342216187967).
103021231111233 is an equidigital number, since it uses as much as digits as its factorization.
103021231111233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 451454391.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 103021231111233 its reverse (332111132120301), we get a palindrome (435132363231534).
The spelling of 103021231111233 in words is "one hundred three trillion, twenty-one billion, two hundred thirty-one million, one hundred eleven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •