Base | Representation |
---|---|
bin | 11101011111010010011… |
… | …01110010011011101010 |
3 | 10120212022202001002112000 |
4 | 32233221031302123222 |
5 | 113100043341122310 |
6 | 2053245455431430 |
7 | 133126533032613 |
oct | 16575115623352 |
9 | 3525282032460 |
10 | 1013230020330 |
11 | 360787a27aa0 |
12 | 144454825576 |
13 | 74716205b38 |
14 | 3707d56ac0a |
15 | 1b552ea24c0 |
hex | ebe93726ea |
1013230020330 has 128 divisors (see below), whose sum is σ = 2980697875200. Its totient is φ = 242871552000.
The previous prime is 1013230020247. The next prime is 1013230020331. The reversal of 1013230020330 is 330200323101.
1013230020330 is a `hidden beast` number, since 1 + 0 + 1 + 32 + 300 + 2 + 0 + 330 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (1013230020331) 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, 1652271 + ... + 2180930.
It is an arithmetic number, because the mean of its divisors is an integer number (23286702150).
Almost surely, 21013230020330 is an apocalyptic number.
1013230020330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1013230020330 is an abundant number, since it is smaller than the sum of its proper divisors (1967467854870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013230020330 is a wasteful number, since it uses less digits than its factorization.
1013230020330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3833317 (or 3833311 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 1013230020330 its reverse (330200323101), we get a palindrome (1343430343431).
The spelling of 1013230020330 in words is "one trillion, thirteen billion, two hundred thirty million, twenty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •