Base | Representation |
---|---|
bin | 11101011110111010111… |
… | …10100110100000001001 |
3 | 10120211211000111120102101 |
4 | 32233131132212200021 |
5 | 113044142433220241 |
6 | 2053214143033401 |
7 | 133121622166663 |
oct | 16573536464011 |
9 | 3524730446371 |
10 | 1013033101321 |
11 | 36069685990a |
12 | 1443ba89b861 |
13 | 746b448a007 |
14 | 3706134b533 |
15 | 1b540a55e31 |
hex | ebdd7a6809 |
1013033101321 has 4 divisors (see below), whose sum is σ = 1015202337552. Its totient is φ = 1010863865092.
The previous prime is 1013033101313. The next prime is 1013033101351. The reversal of 1013033101321 is 1231013303101.
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 1013033101321 - 23 = 1013033101313 is a prime.
It is a super-3 number, since 3×10130331013213 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1013033101351) 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, 1084617415 + ... + 1084618348.
It is an arithmetic number, because the mean of its divisors is an integer number (253800584388).
Almost surely, 21013033101321 is an apocalyptic number.
It is an amenable number.
1013033101321 is a deficient number, since it is larger than the sum of its proper divisors (2169236231).
1013033101321 is an equidigital number, since it uses as much as digits as its factorization.
1013033101321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2169236230.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1013033101321 its reverse (1231013303101), we get a palindrome (2244046404422).
The spelling of 1013033101321 in words is "one trillion, thirteen billion, thirty-three million, one hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.711 sec. • engine limits •