Base | Representation |
---|---|
bin | 1100111100011110001101… |
… | …0111000101001101000110 |
3 | 1212101122222002220222010222 |
4 | 3033013203113011031012 |
5 | 3331143232012132220 |
6 | 50134322511144342 |
7 | 2666206012312412 |
oct | 317074327051506 |
9 | 55348862828128 |
10 | 14233041130310 |
11 | 4598220733052 |
12 | 171a5608150b2 |
13 | 7c32296c08b2 |
14 | 372c50829d42 |
15 | 19a379e66e25 |
hex | cf1e35c5346 |
14233041130310 has 32 divisors (see below), whose sum is σ = 25894152434304. Its totient is φ = 5632268400000.
The previous prime is 14233041130303. The next prime is 14233041130453. The reversal of 14233041130310 is 1303114033241.
It is a super-2 number, since 2×142330411303102 (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 14233041130310.
It is a congruent number.
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, 4480541 + ... + 6967160.
It is an arithmetic number, because the mean of its divisors is an integer number (809192263572).
Almost surely, 214233041130310 is an apocalyptic number.
14233041130310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14233041130310 is a deficient number, since it is larger than the sum of its proper divisors (11661111303994).
14233041130310 is a wasteful number, since it uses less digits than its factorization.
14233041130310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11449040.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 14233041130310 its reverse (1303114033241), we get a palindrome (15536155163551).
The spelling of 14233041130310 in words is "fourteen trillion, two hundred thirty-three billion, forty-one million, one hundred thirty thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •