Base | Representation |
---|---|
bin | 11101001000110010100… |
… | …000101110110111010100 |
3 | 21002102021212211210102220 |
4 | 131020302200232313110 |
5 | 230301203330420200 |
6 | 4131502301102340 |
7 | 264442625615142 |
oct | 35106240566724 |
9 | 7072255753386 |
10 | 2002302201300 |
11 | 702198435795 |
12 | 284086b579b0 |
13 | 116a7c4ca46b |
14 | 6ccaa532592 |
15 | 371401864a0 |
hex | 1d23282edd4 |
2002302201300 has 36 divisors (see below), whose sum is σ = 5793327703296. Its totient is φ = 533947253600.
The previous prime is 2002302201299. The next prime is 2002302201313. The reversal of 2002302201300 is 31022032002.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2002302201300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3337170036 + ... + 3337170635.
It is an arithmetic number, because the mean of its divisors is an integer number (160925769536).
Almost surely, 22002302201300 is an apocalyptic number.
2002302201300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2002302201300 is an abundant number, since it is smaller than the sum of its proper divisors (3791025501996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002302201300 is a wasteful number, since it uses less digits than its factorization.
2002302201300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6674340688 (or 6674340681 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 2002302201300 its reverse (31022032002), we get a palindrome (2033324233302).
The spelling of 2002302201300 in words is "two trillion, two billion, three hundred two million, two hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •