Base | Representation |
---|---|
bin | 11101111110111001100… |
… | …10001101011010011001 |
3 | 10122111010111120010100210 |
4 | 32333130302031122121 |
5 | 113334323020132101 |
6 | 2105133513521333 |
7 | 134300230564512 |
oct | 16773462153231 |
9 | 3574114503323 |
10 | 1030201333401 |
11 | 3679a6882769 |
12 | 1477b0413249 |
13 | 761bc293b16 |
14 | 37c0d4dda09 |
15 | 1bbe7dae7d6 |
hex | efdcc8d699 |
1030201333401 has 4 divisors (see below), whose sum is σ = 1373601777872. Its totient is φ = 686800888932.
The previous prime is 1030201333373. The next prime is 1030201333411. The reversal of 1030201333401 is 1043331020301.
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 not a de Polignac number, because 1030201333401 - 29 = 1030201332889 is a prime.
It is a super-2 number, since 2×10302013334012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1030201333411) 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, 171700222231 + ... + 171700222236.
It is an arithmetic number, because the mean of its divisors is an integer number (343400444468).
Almost surely, 21030201333401 is an apocalyptic number.
It is an amenable number.
1030201333401 is a deficient number, since it is larger than the sum of its proper divisors (343400444471).
1030201333401 is an equidigital number, since it uses as much as digits as its factorization.
1030201333401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 343400444470.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1030201333401 its reverse (1043331020301), we get a palindrome (2073532353702).
The spelling of 1030201333401 in words is "one trillion, thirty billion, two hundred one million, three hundred thirty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •