Base | Representation |
---|---|
bin | 1100000111011001011111… |
… | …1001100011110011111000 |
3 | 1202011111110021001122210101 |
4 | 3001312113321203303320 |
5 | 3221223400430032100 |
6 | 44155405532125144 |
7 | 2543266540003420 |
oct | 301662771436370 |
9 | 52144407048711 |
10 | 13321242033400 |
11 | 42765639310a4 |
12 | 15b18b50067b4 |
13 | 7582595b2352 |
14 | 340a743a1480 |
15 | 1817b1b5186a |
hex | c1d97e63cf8 |
13321242033400 has 48 divisors (see below), whose sum is σ = 35396443121040. Its totient is φ = 4567282982400.
The previous prime is 13321242033397. The next prime is 13321242033431. The reversal of 13321242033400 is 433024212331.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (28).
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, 4757585041 + ... + 4757587840.
It is an arithmetic number, because the mean of its divisors is an integer number (737425898355).
Almost surely, 213321242033400 is an apocalyptic number.
13321242033400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13321242033400 is an abundant number, since it is smaller than the sum of its proper divisors (22075201087640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13321242033400 is a wasteful number, since it uses less digits than its factorization.
13321242033400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9515172904 (or 9515172895 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 13321242033400 its reverse (433024212331), we get a palindrome (13754266245731).
The spelling of 13321242033400 in words is "thirteen trillion, three hundred twenty-one billion, two hundred forty-two million, thirty-three thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •