Base | Representation |
---|---|
bin | 110000001101011110110… |
… | …111100010001001010101 |
3 | 102201201110110102222022010 |
4 | 300031132313202021111 |
5 | 413240021404320201 |
6 | 11013550524054433 |
7 | 461233340161140 |
oct | 60153667421125 |
9 | 12651413388263 |
10 | 3313011401301 |
11 | 1068049625398 |
12 | 456100994419 |
13 | 1b05531c2b24 |
14 | b64ca0d1057 |
15 | 5b2a4357bd6 |
hex | 3035ede2255 |
3313011401301 has 64 divisors (see below), whose sum is σ = 5219584819200. Its totient is φ = 1830087198720.
The previous prime is 3313011401267. The next prime is 3313011401317. The reversal of 3313011401301 is 1031041103133.
3313011401301 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3313011401301 - 26 = 3313011401237 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3313011401341) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 26847021 + ... + 26970141.
It is an arithmetic number, because the mean of its divisors is an integer number (81556012800).
Almost surely, 23313011401301 is an apocalyptic number.
It is an amenable number.
3313011401301 is a deficient number, since it is larger than the sum of its proper divisors (1906573417899).
3313011401301 is a wasteful number, since it uses less digits than its factorization.
3313011401301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123514.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 3313011401301 its reverse (1031041103133), we get a palindrome (4344052504434).
The spelling of 3313011401301 in words is "three trillion, three hundred thirteen billion, eleven million, four hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •