Base | Representation |
---|---|
bin | 1110001111110111001001… |
… | …10100000001100001110110 |
3 | 11002221020122021112100122120 |
4 | 13013323210310001201312 |
5 | 13101313031024100042 |
6 | 150345225303540410 |
7 | 6412420400255304 |
oct | 707734464014166 |
9 | 132836567470576 |
10 | 31331330300022 |
11 | 9a8a5a716a385 |
12 | 362027b15a706 |
13 | 14636bb3b514c |
14 | 7a463190b274 |
15 | 394eee500dec |
hex | 1c7ee4d01876 |
31331330300022 has 32 divisors (see below), whose sum is σ = 63121972665312. Its totient is φ = 10367229394944.
The previous prime is 31331330299991. The next prime is 31331330300057. The reversal of 31331330300022 is 22000303313313.
It is a super-4 number, since 4×313313303000224 (a number of 55 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31331330299965 and 31331330300001.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27267558 + ... + 28393350.
It is an arithmetic number, because the mean of its divisors is an integer number (1972561645791).
Almost surely, 231331330300022 is an apocalyptic number.
31331330300022 is an abundant number, since it is smaller than the sum of its proper divisors (31790642365290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31331330300022 is a wasteful number, since it uses less digits than its factorization.
31331330300022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1159792.
The product of its (nonzero) digits is 2916, while the sum is 24.
Adding to 31331330300022 its reverse (22000303313313), we get a palindrome (53331633613335).
The spelling of 31331330300022 in words is "thirty-one trillion, three hundred thirty-one billion, three hundred thirty million, three hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •