Base | Representation |
---|---|
bin | 11101011110111000100… |
… | …10010101111000111010 |
3 | 10120211202121212220221022 |
4 | 32233130102111320322 |
5 | 113044122324012310 |
6 | 2053212150342442 |
7 | 133121260236134 |
oct | 16573422257072 |
9 | 3524677786838 |
10 | 1013013110330 |
11 | 360686545331 |
12 | 1443b405aa22 |
13 | 746b02aaa20 |
14 | 3705c826054 |
15 | 1b53de07a55 |
hex | ebdc495e3a |
1013013110330 has 128 divisors (see below), whose sum is σ = 2088098611200. Its totient is φ = 350530412544.
The previous prime is 1013013110321. The next prime is 1013013110359. The reversal of 1013013110330 is 330113103101.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a junction number, because it is equal to n+sod(n) for n = 1013013110299 and 1013013110308.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 792034631 + ... + 792035909.
It is an arithmetic number, because the mean of its divisors is an integer number (16313270400).
Almost surely, 21013013110330 is an apocalyptic number.
1013013110330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1013013110330 is an abundant number, since it is smaller than the sum of its proper divisors (1075085500870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013013110330 is a wasteful number, since it uses less digits than its factorization.
1013013110330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2568.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 1013013110330 its reverse (330113103101), we get a palindrome (1343126213431).
The spelling of 1013013110330 in words is "one trillion, thirteen billion, thirteen million, one hundred ten thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •