Base | Representation |
---|---|
bin | 100010001111101111100111… |
… | …0110000011010000010010101 |
3 | 1110111120101212022210222212221 |
4 | 1010133133032300122002111 |
5 | 303440332042011213023 |
6 | 2544355335552342341 |
7 | 120310135665623263 |
oct | 10437371660320225 |
9 | 1414511768728787 |
10 | 301231000101013 |
11 | 87a88393532304 |
12 | 299507045449b1 |
13 | cc10c66328a58 |
14 | 5455930141433 |
15 | 24c5a99d7485d |
hex | 111f7cec1a095 |
301231000101013 has 4 divisors (see below), whose sum is σ = 301232970642240. Its totient is φ = 301229029559788.
The previous prime is 301231000100981. The next prime is 301231000101029. The reversal of 301231000101013 is 310101000132103.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 301231000101013 - 25 = 301231000100981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (301231000801013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 985041295 + ... + 985347052.
It is an arithmetic number, because the mean of its divisors is an integer number (75308242660560).
Almost surely, 2301231000101013 is an apocalyptic number.
It is an amenable number.
301231000101013 is a deficient number, since it is larger than the sum of its proper divisors (1970541227).
301231000101013 is a wasteful number, since it uses less digits than its factorization.
301231000101013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1970541226.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 301231000101013 its reverse (310101000132103), we get a palindrome (611332000233116).
The spelling of 301231000101013 in words is "three hundred one trillion, two hundred thirty-one billion, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •