Base | Representation |
---|---|
bin | 1011110101011110000110… |
… | …0011110111010111101111 |
3 | 1201002001110002022010210200 |
4 | 2331113201203313113233 |
5 | 3201202103443340043 |
6 | 43402111112204543 |
7 | 2512114136515356 |
oct | 275274143672757 |
9 | 51061402263720 |
10 | 13013240215023 |
11 | 416797a935264 |
12 | 1562077999753 |
13 | 7351b2a54a89 |
14 | 32dbb664099d |
15 | 178786c387d3 |
hex | bd5e18f75ef |
13013240215023 has 12 divisors (see below), whose sum is σ = 18796943185800. Its totient is φ = 8675474713776.
The previous prime is 13013240214973. The next prime is 13013240215033. The reversal of 13013240215023 is 32051204231031.
13013240215023 is a `hidden beast` number, since 1 + 3 + 0 + 132 + 4 + 0 + 21 + 502 + 3 = 666.
It is not a de Polignac number, because 13013240215023 - 29 = 13013240214511 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13013240215033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3795840 + ... + 6358842.
It is an arithmetic number, because the mean of its divisors is an integer number (1566411932150).
Almost surely, 213013240215023 is an apocalyptic number.
13013240215023 is a deficient number, since it is larger than the sum of its proper divisors (5783702970777).
13013240215023 is a wasteful number, since it uses less digits than its factorization.
13013240215023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3127158 (or 3127155 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
Adding to 13013240215023 its reverse (32051204231031), we get a palindrome (45064444446054).
The spelling of 13013240215023 in words is "thirteen trillion, thirteen billion, two hundred forty million, two hundred fifteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •