Base | Representation |
---|---|
bin | 100011100101011000000001… |
… | …1111010000000111010000011 |
3 | 1112001020111222021202120022022 |
4 | 1013022300003322000322003 |
5 | 312011143202130444021 |
6 | 3025410132323232055 |
7 | 122633340214120436 |
oct | 10712600372007203 |
9 | 1461214867676268 |
10 | 313000102203011 |
11 | 90805663885913 |
12 | 2b131624b1862b |
13 | 10585a242c5692 |
14 | 574140026381d |
15 | 262bcb6e831ab |
hex | 11cac03e80e83 |
313000102203011 has 8 divisors (see below), whose sum is σ = 323507077579920. Its totient is φ = 302600890676448.
The previous prime is 313000102202987. The next prime is 313000102203073. The reversal of 313000102203011 is 110302201000313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 313000102203011 - 210 = 313000102201987 is a prime.
It is a super-2 number, since 2×3130001022030112 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (313000102203211) 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, 26940956681 + ... + 26940968298.
It is an arithmetic number, because the mean of its divisors is an integer number (40438384697490).
Almost surely, 2313000102203011 is an apocalyptic number.
313000102203011 is a deficient number, since it is larger than the sum of its proper divisors (10506975376909).
313000102203011 is a wasteful number, since it uses less digits than its factorization.
313000102203011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53881925173.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 313000102203011 its reverse (110302201000313), we get a palindrome (423302303203324).
The spelling of 313000102203011 in words is "three hundred thirteen trillion, one hundred two million, two hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •