Base | Representation |
---|---|
bin | 100011100101100111110111… |
… | …1100011010010101001110001 |
3 | 1112001100202210002002002011122 |
4 | 1013023033233203102221301 |
5 | 312012222334313043213 |
6 | 3025433520100152025 |
7 | 122635653215301260 |
oct | 10713175743225161 |
9 | 1461322702062148 |
10 | 313034120440433 |
11 | 9081903022a117 |
12 | 2b138139698615 |
13 | 10588cb5cc6252 |
14 | 5742d0a20c5d7 |
15 | 262cb08735d08 |
hex | 11cb3ef8d2a71 |
313034120440433 has 16 divisors (see below), whose sum is σ = 362794543393920. Its totient is φ = 264556059552000.
The previous prime is 313034120440417. The next prime is 313034120440463. The reversal of 313034120440433 is 334044021430313.
It is a cyclic number.
It is not a de Polignac number, because 313034120440433 - 24 = 313034120440417 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 313034120440393 and 313034120440402.
It is not an unprimeable number, because it can be changed into a prime (313034120440403) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 918427043 + ... + 918767816.
It is an arithmetic number, because the mean of its divisors is an integer number (22674658962120).
Almost surely, 2313034120440433 is an apocalyptic number.
It is an amenable number.
313034120440433 is a deficient number, since it is larger than the sum of its proper divisors (49760422953487).
313034120440433 is a wasteful number, since it uses less digits than its factorization.
313034120440433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1837195208.
The product of its (nonzero) digits is 124416, while the sum is 35.
Adding to 313034120440433 its reverse (334044021430313), we get a palindrome (647078141870746).
The spelling of 313034120440433 in words is "three hundred thirteen trillion, thirty-four billion, one hundred twenty million, four hundred forty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •