Base | Representation |
---|---|
bin | 1011110101011010011010… |
… | …0110011001100001010100 |
3 | 1201001221220010222000001112 |
4 | 2331112212212121201110 |
5 | 3201143042230222234 |
6 | 43401425014314152 |
7 | 2512050465522041 |
oct | 275264646314124 |
9 | 51057803860045 |
10 | 13012251023444 |
11 | 4167512523a62 |
12 | 1561a40658958 |
13 | 735085b3040a |
14 | 32db211081c8 |
15 | 178729e8eace |
hex | bd5a6999854 |
13012251023444 has 48 divisors (see below), whose sum is σ = 23282691062400. Its totient is φ = 6361268516736.
The previous prime is 13012251023411. The next prime is 13012251023461. The reversal of 13012251023444 is 44432015221031.
13012251023444 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×130122510234442 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13012251023444.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 144498617 + ... + 144588639.
It is an arithmetic number, because the mean of its divisors is an integer number (485056063800).
Almost surely, 213012251023444 is an apocalyptic number.
It is an amenable number.
13012251023444 is a deficient number, since it is larger than the sum of its proper divisors (10270440038956).
13012251023444 is a wasteful number, since it uses less digits than its factorization.
13012251023444 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93392 (or 93390 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 13012251023444 its reverse (44432015221031), we get a palindrome (57444266244475).
The spelling of 13012251023444 in words is "thirteen trillion, twelve billion, two hundred fifty-one million, twenty-three thousand, four hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •