Base | Representation |
---|---|
bin | 101011110110101001001… |
… | …011010010100001111001 |
3 | 101200002122200121101122012 |
4 | 223312221023102201321 |
5 | 343333333224232411 |
6 | 10224233345135305 |
7 | 430504034415305 |
oct | 53665113224171 |
9 | 11602580541565 |
10 | 3013610383481 |
11 | a62079551295 |
12 | 40808402a535 |
13 | 18b24a4c4759 |
14 | a5c0674cd05 |
15 | 535ce56518b |
hex | 2bda92d2879 |
3013610383481 has 2 divisors, whose sum is σ = 3013610383482. Its totient is φ = 3013610383480.
The previous prime is 3013610383457. The next prime is 3013610383513. The reversal of 3013610383481 is 1843830163103.
It is a happy number.
3013610383481 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2993104143481 + 20506240000 = 1730059^2 + 143200^2 .
It is a cyclic number.
It is not a de Polignac number, because 3013610383481 - 218 = 3013610121337 is a prime.
It is a super-2 number, since 2×30136103834812 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3013610389481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1506805191740 + 1506805191741.
It is an arithmetic number, because the mean of its divisors is an integer number (1506805191741).
Almost surely, 23013610383481 is an apocalyptic number.
It is an amenable number.
3013610383481 is a deficient number, since it is larger than the sum of its proper divisors (1).
3013610383481 is an equidigital number, since it uses as much as digits as its factorization.
3013610383481 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 124416, while the sum is 41.
The spelling of 3013610383481 in words is "three trillion, thirteen billion, six hundred ten million, three hundred eighty-three thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •