Base | Representation |
---|---|
bin | 1100101111101010111010… |
… | …1000101001100111000010 |
3 | 1211121122021221202002222020 |
4 | 3023322232220221213002 |
5 | 3314042323440230310 |
6 | 45445311344422310 |
7 | 2644262002663302 |
oct | 313725650514702 |
9 | 54548257662866 |
10 | 14013113211330 |
11 | 4512a230a5422 |
12 | 16a3a03317996 |
13 | 7a857a9138ac |
14 | 366349c67602 |
15 | 1947a7264170 |
hex | cbeaea299c2 |
14013113211330 has 32 divisors (see below), whose sum is σ = 33632116657344. Its totient is φ = 3736758528576.
The previous prime is 14013113211323. The next prime is 14013113211353. The reversal of 14013113211330 is 3311231131041.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 14013113211330.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2879004 + ... + 6026183.
It is an arithmetic number, because the mean of its divisors is an integer number (1051003645542).
Almost surely, 214013113211330 is an apocalyptic number.
14013113211330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14013113211330 is an abundant number, since it is smaller than the sum of its proper divisors (19619003446014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14013113211330 is a wasteful number, since it uses less digits than its factorization.
14013113211330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8957650.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 14013113211330 its reverse (3311231131041), we get a palindrome (17324344342371).
The spelling of 14013113211330 in words is "fourteen trillion, thirteen billion, one hundred thirteen million, two hundred eleven thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •