Base | Representation |
---|---|
bin | 1101110010001110110001… |
… | …10001101110101111010111 |
3 | 10222022220201111111102110121 |
4 | 12321013120301232233113 |
5 | 12433122434101414111 |
6 | 144245411310532411 |
7 | 6246025610121010 |
oct | 671073061565727 |
9 | 128286644442417 |
10 | 30313221123031 |
11 | 9727846072810 |
12 | 3496aa4507107 |
13 | 13bb6a83b1482 |
14 | 76b24c378007 |
15 | 3787b3017871 |
hex | 1b91d8c6ebd7 |
30313221123031 has 16 divisors (see below), whose sum is σ = 38011564136448. Its totient is φ = 23484155983200.
The previous prime is 30313221122903. The next prime is 30313221123191. The reversal of 30313221123031 is 13032112231303.
It is not a de Polignac number, because 30313221123031 - 27 = 30313221122903 is a prime.
It is a super-2 number, since 2×303132211230312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30313221122987 and 30313221123005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30313221123431) 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, 1137784935 + ... + 1137811576.
It is an arithmetic number, because the mean of its divisors is an integer number (2375722758528).
Almost surely, 230313221123031 is an apocalyptic number.
30313221123031 is a deficient number, since it is larger than the sum of its proper divisors (7698343013417).
30313221123031 is a wasteful number, since it uses less digits than its factorization.
30313221123031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2275596702.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 30313221123031 its reverse (13032112231303), we get a palindrome (43345333354334).
The spelling of 30313221123031 in words is "thirty trillion, three hundred thirteen billion, two hundred twenty-one million, one hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •